Base | Representation |
---|---|
bin | 100101001001101100010… |
… | …1100001101101010011110 |
3 | 200002010121212100110201110 |
4 | 1022103120230031222132 |
5 | 1132124200443212411 |
6 | 14505405013522450 |
7 | 1034620562062041 |
oct | 112233054155236 |
9 | 20063555313643 |
10 | 5106056616606 |
11 | 1699514933330 |
12 | 6a5708043426 |
13 | 2b06646036ca |
14 | 1391c4d52c58 |
15 | 8cc485292a6 |
hex | 4a4d8b0da9e |
5106056616606 has 128 divisors (see below), whose sum is σ = 11643788620800. Its totient is φ = 1478503040000.
The previous prime is 5106056616581. The next prime is 5106056616643. The reversal of 5106056616606 is 6066166506015.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 620340511 + ... + 620348741.
It is an arithmetic number, because the mean of its divisors is an integer number (90967098600).
Almost surely, 25106056616606 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5106056616606, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5821894310400).
5106056616606 is an abundant number, since it is smaller than the sum of its proper divisors (6537732004194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106056616606 is a wasteful number, since it uses less digits than its factorization.
5106056616606 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11586.
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 5106056616606 in words is "five trillion, one hundred six billion, fifty-six million, six hundred sixteen thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •