Base | Representation |
---|---|
bin | 1001001100110001101011… |
… | …1100111100011101110101 |
3 | 1022210222211201111111200200 |
4 | 2103030122330330131311 |
5 | 2311211211120303010 |
6 | 33302451325031113 |
7 | 2062535416535352 |
oct | 223143274743565 |
9 | 38728751444620 |
10 | 10115100166005 |
11 | 324a87638635a |
12 | 117445a6b5499 |
13 | 584b08185223 |
14 | 26d805809629 |
15 | 1281b4b7acc0 |
hex | 9331af3c775 |
10115100166005 has 48 divisors (see below), whose sum is σ = 17861679351360. Its totient is φ = 5293863684864.
The previous prime is 10115100165901. The next prime is 10115100166019. The reversal of 10115100166005 is 50066100151101.
10115100166005 is a `hidden beast` number, since 1 + 0 + 1 + 1 + 51 + 0 + 0 + 1 + 6 + 600 + 5 = 666.
It is not a de Polignac number, because 10115100166005 - 29 = 10115100165493 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10115100166005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1888744 + ... + 4878273.
It is an arithmetic number, because the mean of its divisors is an integer number (372118319820).
Almost surely, 210115100166005 is an apocalyptic number.
10115100166005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10115100166005 is a deficient number, since it is larger than the sum of its proper divisors (7746579185355).
10115100166005 is a wasteful number, since it uses less digits than its factorization.
10115100166005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6767650 (or 6767647 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
The spelling of 10115100166005 in words is "ten trillion, one hundred fifteen billion, one hundred million, one hundred sixty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •