Base | Representation |
---|---|
bin | 1001110001001000… |
… | …10011111000110001 |
3 | 111112110112022101211 |
4 | 10320210103320301 |
5 | 41214431310113 |
6 | 2224205200121 |
7 | 243644230663 |
oct | 47044237061 |
9 | 14473468354 |
10 | 5244010033 |
11 | 225111a399 |
12 | 1024260041 |
13 | 657584a22 |
14 | 37a65c533 |
15 | 20a5a5b3d |
hex | 138913e31 |
5244010033 has 2 divisors, whose sum is σ = 5244010034. Its totient is φ = 5244010032.
The previous prime is 5244010027. The next prime is 5244010061. The reversal of 5244010033 is 3300104425.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3390965824 + 1853044209 = 58232^2 + 43047^2 .
It is a cyclic number.
It is not a de Polignac number, because 5244010033 - 217 = 5243878961 is a prime.
It is a super-2 number, since 2×52440100332 = 54999282452409322178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5244009986 and 5244010013.
It is not a weakly prime, because it can be changed into another prime (5244050033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2622005016 + 2622005017.
It is an arithmetic number, because the mean of its divisors is an integer number (2622005017).
Almost surely, 25244010033 is an apocalyptic number.
It is an amenable number.
5244010033 is a deficient number, since it is larger than the sum of its proper divisors (1).
5244010033 is an equidigital number, since it uses as much as digits as its factorization.
5244010033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 5244010033 is about 72415.5372347675. The cubic root of 5244010033 is about 1737.3520777267.
Adding to 5244010033 its reverse (3300104425), we get a palindrome (8544114458).
The spelling of 5244010033 in words is "five billion, two hundred forty-four million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •