Base | Representation |
---|---|
bin | 1001011000011000… |
… | …00011001001101001 |
3 | 110222222201201221112 |
4 | 10230030003021221 |
5 | 40303244322213 |
6 | 2151425520105 |
7 | 235543020461 |
oct | 45414031151 |
9 | 13888651845 |
10 | 5036323433 |
11 | 2154967379 |
12 | b867a3035 |
13 | 623538b4b |
14 | 35ac38ba1 |
15 | 1e722dea8 |
hex | 12c303269 |
5036323433 has 2 divisors, whose sum is σ = 5036323434. Its totient is φ = 5036323432.
The previous prime is 5036323403. The next prime is 5036323441. The reversal of 5036323433 is 3343236305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2723482969 + 2312840464 = 52187^2 + 48092^2 .
It is a cyclic number.
It is not a de Polignac number, because 5036323433 - 214 = 5036307049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5036323433.
It is not a weakly prime, because it can be changed into another prime (5036323403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2518161716 + 2518161717.
It is an arithmetic number, because the mean of its divisors is an integer number (2518161717).
Almost surely, 25036323433 is an apocalyptic number.
It is an amenable number.
5036323433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5036323433 is an equidigital number, since it uses as much as digits as its factorization.
5036323433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 32.
The square root of 5036323433 is about 70967.0587878630. The cubic root of 5036323433 is about 1714.1067728299.
Adding to 5036323433 its reverse (3343236305), we get a palindrome (8379559738).
The spelling of 5036323433 in words is "five billion, thirty-six million, three hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •