Given a decimal number as input, we need to write a program to convert the given decimal number into equivalent hexadecimal number. i.e convert the number with base value 10 to base value 16.
Hexadecimal numbers use 16 values to represent a number. Numbers from 0-9 are expressed by digits 0-9 and 10-15 are represented by characters from A – F.
Examples:
Input : 116
Output: 74
Input : 10
Output: A
Input : 33
Output: 21
Algorithm:
- Store the remainder when the number is divided by 16 in a temporary variable temp. If temp is less than 10, insert (48 + temp) in a character array otherwise if temp is greater than or equals to 10, insert (55 + temp) in the character array.
- Divide the number by 16 now
- Repeat the above two steps until the number is not equal to 0.
- Print the array in reverse order now.
Example
If the given decimal number is 2545.
Step 1: Calculate remainder when 2545 is divided by 16 is 1. Therefore, temp = 1. As temp is less than 10. So, arr[0] = 48 + 1 = 49 = ‘1’.
Step 2: Divide 2545 by 16. New number is 2545/16 = 159.
Step 3: Calculate remainder when 159 is divided by 16 is 15. Therefore, temp = 15. As temp is greater than 10. So, arr[1] = 55 + 15 = 70 = ‘F’.
Step 4: Divide 159 by 16. New number is 159/16 = 9.
Step 5: Calculate remainder when 9 is divided by 16 is 9. Therefore, temp = 9. As temp is less than 10. So, arr[2] = 48 + 9 = 57 = ‘9’.
Step 6: Divide 9 by 16. New number is 9/16 = 0.
Step 7: Since number becomes = 0. Stop repeating steps and print the array in reverse order. Therefore, the equivalent hexadecimal number is 9F1.
Below diagram shows an example of converting the decimal number 2545 to an equivalent hexadecimal number.

Below is the implementation of the above idea.
C++
#include <iostream>
using namespace std;
string decToHexa( int n)
{
string ans = "" ;
while (n != 0) {
int rem = 0;
char ch;
rem = n % 16;
if (rem < 10) {
ch = rem + 48;
}
else {
ch = rem + 55;
}
ans += ch;
n = n / 16;
}
int i = 0, j = ans.size() - 1;
while (i <= j)
{
swap(ans[i], ans[j]);
i++;
j--;
}
return ans;
}
int main()
{
int n = 2545;
cout << decToHexa(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
static void decToHexa( int n)
{
char [] hexaDeciNum = new char [ 100 ];
int i = 0 ;
while (n != 0 ) {
int temp = 0 ;
temp = n % 16 ;
if (temp < 10 ) {
hexaDeciNum[i] = ( char )(temp + 48 );
i++;
}
else {
hexaDeciNum[i] = ( char )(temp + 55 );
i++;
}
n = n / 16 ;
}
for ( int j = i - 1 ; j >= 0 ; j--)
System.out.print(hexaDeciNum[j]);
}
public static void main(String[] args)
{
int n = 2545 ;
decToHexa(n);
}
}
|
Python3
def decToHexa(n):
hexaDeciNum = [ '0' ] * 100
i = 0
while (n ! = 0 ):
temp = 0
temp = n % 16
if (temp < 10 ):
hexaDeciNum[i] = chr (temp + 48 )
i = i + 1
else :
hexaDeciNum[i] = chr (temp + 55 )
i = i + 1
n = int (n / 16 )
j = i - 1
while (j > = 0 ):
print ((hexaDeciNum[j]), end = "")
j = j - 1
n = 2545
decToHexa(n)
|
C#
using System;
class GFG {
static void decToHexa( int n)
{
char [] hexaDeciNum = new char [100];
int i = 0;
while (n != 0) {
int temp = 0;
temp = n % 16;
if (temp < 10) {
hexaDeciNum[i] = ( char )(temp + 48);
i++;
}
else {
hexaDeciNum[i] = ( char )(temp + 55);
i++;
}
n = n / 16;
}
for ( int j = i - 1; j >= 0; j--)
Console.Write(hexaDeciNum[j]);
}
public static void Main(String[] args)
{
int n = 2545;
decToHexa(n);
}
}
|
PHP
<?php
function decToHexa( $n )
{
$hexaDeciNum ;
$i = 0;
while ( $n != 0)
{
$temp = 0;
$temp = $n % 16;
if ( $temp < 10)
{
$hexaDeciNum [ $i ] = chr ( $temp + 48);
$i ++;
}
else
{
$hexaDeciNum [ $i ] = chr ( $temp + 55);
$i ++;
}
$n = (int)( $n / 16);
}
for ( $j = $i - 1; $j >= 0; $j --)
echo $hexaDeciNum [ $j ];
}
$n = 2545;
decToHexa( $n );
?>
|
Javascript
<script>
function decToHexa(n)
{
var hexaDeciNum = Array.from({length: 100},
(_, i) => 0);
var i = 0;
while (n != 0) {
var temp = 0;
temp = n % 16;
if (temp < 10) {
hexaDeciNum[i] =
String.fromCharCode(temp + 48);
i++;
}
else {
hexaDeciNum[i] =
String.fromCharCode(temp + 55);
i++;
}
n = parseInt(n / 16);
}
for (j = i - 1; j >= 0; j--)
document.write(hexaDeciNum[j]);
}
var n = 2545;
decToHexa(n);
</script>
|
Time complexity: O(log16n)
Auxiliary space: O(1)
Using Predefined function
C++
#include <iostream>
using namespace std;
void decToHexa( int n) { cout << hex << n << endl; }
int main()
{
int n = 2545;
decToHexa(n);
return 0;
}
|
Java
import java.io.*;
class GFG {
public static void decToHexa( int n)
{
System.out.println(Integer.toHexString(n));
}
public static void main(String[] args)
{
int n = 2545 ;
decToHexa(n);
}
}
|
Python3
def decToHexa(n):
return hex (n).replace( "0x" ,"")
n = 2545
print (decToHexa(n))
|
C#
using System;
class GFG {
public static void decToHexa( int n)
{
Console.Write(Convert.ToString(n));
}
public static void Main(String[] args)
{
int n = 2545;
decToHexa(n);
}
}
|
Javascript
<script>
function decToHexa(n)
{
document.write(n.toString(16));
}
var n = 2545;
decToHexa(n);
</script>
|
Time Complexity: O(log16(n)), because we divide the n by 16 till it becomes zero.
Auxiliary Space: O(1), we cannot use any extra space.
If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
15 Sep, 2023
Like Article
Save Article