Base | Representation |
---|---|
bin | 100101100010110111010… |
… | …0001100100001010000010 |
3 | 200021022010221100121202200 |
4 | 1023011232201210022002 |
5 | 1134020401130440411 |
6 | 14550304413454030 |
7 | 1041543223302114 |
oct | 113055641441202 |
9 | 20238127317680 |
10 | 5160110015106 |
11 | 170a4326416a2 |
12 | 6b40924a1316 |
13 | 2b579a070087 |
14 | 13ba71b373b4 |
15 | 8e35db90e56 |
hex | 4b16e864282 |
5160110015106 has 24 divisors (see below), whose sum is σ = 11314940036400. Its totient is φ = 1699313337816.
The previous prime is 5160110015077. The next prime is 5160110015107. The reversal of 5160110015106 is 6015100110615.
5160110015106 is a `hidden beast` number, since 5 + 1 + 601 + 1 + 0 + 0 + 1 + 51 + 0 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 5160110015106.
It is not an unprimeable number, because it can be changed into a prime (5160110015107) 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 11 ways as a sum of consecutive naturals, for example, 1726942956 + ... + 1726945943.
It is an arithmetic number, because the mean of its divisors is an integer number (471455834850).
Almost surely, 25160110015106 is an apocalyptic number.
5160110015106 is an abundant number, since it is smaller than the sum of its proper divisors (6154830021294).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5160110015106 is a wasteful number, since it uses less digits than its factorization.
5160110015106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3453888990 (or 3453888987 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 5160110015106 in words is "five trillion, one hundred sixty billion, one hundred ten million, fifteen thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •