Base | Representation |
---|---|
bin | 1001110001111110… |
… | …00111001110001011 |
3 | 111112221202021021102 |
4 | 10320333013032023 |
5 | 41223231123133 |
6 | 2225015532015 |
7 | 244061032661 |
oct | 47077071613 |
9 | 14487667242 |
10 | 5251036043 |
11 | 2255089110 |
12 | 102668a00b |
13 | 658b74a26 |
14 | 37b56ac31 |
15 | 20aee27e8 |
hex | 138fc738b |
5251036043 has 8 divisors (see below), whose sum is σ = 5729376240. Its totient is φ = 4772858080.
The previous prime is 5251036033. The next prime is 5251036057. The reversal of 5251036043 is 3406301525.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5251036043 - 28 = 5251035787 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5251035997 and 5251036015.
It is not an unprimeable number, because it can be changed into a prime (5251036013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32921 + ... + 107637.
It is an arithmetic number, because the mean of its divisors is an integer number (716172030).
Almost surely, 25251036043 is an apocalyptic number.
5251036043 is a deficient number, since it is larger than the sum of its proper divisors (478340197).
5251036043 is a wasteful number, since it uses less digits than its factorization.
5251036043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81117.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 5251036043 is about 72464.0327541878. The cubic root of 5251036043 is about 1738.1276423227.
Adding to 5251036043 its reverse (3406301525), we get a palindrome (8657337568).
The spelling of 5251036043 in words is "five billion, two hundred fifty-one million, thirty-six thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •