Base | Representation |
---|---|
bin | 1001010100101101… |
… | …01011100101010011 |
3 | 110220211211121000212 |
4 | 10222112223211103 |
5 | 40222410243201 |
6 | 2144410234335 |
7 | 235020344606 |
oct | 45226534523 |
9 | 13824747025 |
10 | 5005556051 |
11 | 2139562391 |
12 | b784259ab |
13 | 61a0557b2 |
14 | 356b0a33d |
15 | 1e46a2abb |
hex | 12a5ab953 |
5005556051 has 8 divisors (see below), whose sum is σ = 5070343680. Its totient is φ = 4940804232.
The previous prime is 5005556021. The next prime is 5005556077. The reversal of 5005556051 is 1506555005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5005556051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5005555999 and 5005556017.
It is not an unprimeable number, because it can be changed into a prime (5005556021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 380876 + ... + 393798.
It is an arithmetic number, because the mean of its divisors is an integer number (633792960).
Almost surely, 25005556051 is an apocalyptic number.
5005556051 is a deficient number, since it is larger than the sum of its proper divisors (64787629).
5005556051 is a wasteful number, since it uses less digits than its factorization.
5005556051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17905.
The product of its (nonzero) digits is 18750, while the sum is 32.
The square root of 5005556051 is about 70749.9544240136. The cubic root of 5005556051 is about 1710.6090931195.
The spelling of 5005556051 in words is "five billion, five million, five hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •