Base | Representation |
---|---|
bin | 100101010000101110101… |
… | …0100001111000011000011 |
3 | 200010120121220110021121020 |
4 | 1022201131110033003003 |
5 | 1132401122122234220 |
6 | 14520344221200523 |
7 | 1035664165613622 |
oct | 112413524170303 |
9 | 20116556407536 |
10 | 5121166602435 |
11 | 16a4969047324 |
12 | 6a8624400143 |
13 | 2b1c01b7b520 |
14 | 139c19a076b9 |
15 | 8d32ed17040 |
hex | 4a85d50f0c3 |
5121166602435 has 64 divisors (see below), whose sum is σ = 8875839772800. Its totient is φ = 2506434416640.
The previous prime is 5121166602413. The next prime is 5121166602457. The reversal of 5121166602435 is 5342066611215.
It is an interprime number because it is at equal distance from previous prime (5121166602413) and next prime (5121166602457).
It is not a de Polignac number, because 5121166602435 - 29 = 5121166601923 is a prime.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 114933541 + ... + 114978089.
It is an arithmetic number, because the mean of its divisors is an integer number (138684996450).
Almost surely, 25121166602435 is an apocalyptic number.
5121166602435 is a deficient number, since it is larger than the sum of its proper divisors (3754673170365).
5121166602435 is a wasteful number, since it uses less digits than its factorization.
5121166602435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48008.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 5121166602435 in words is "five trillion, one hundred twenty-one billion, one hundred sixty-six million, six hundred two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •