Base | Representation |
---|---|
bin | 10111001101111011010011… |
… | …011100101010010011101101 |
3 | 111101112211011211002110102212 |
4 | 113031323103130222103231 |
5 | 101341001040100013010 |
6 | 1001101352351500205 |
7 | 30336233013010553 |
oct | 2715732334522355 |
9 | 441484154073385 |
10 | 102112100001005 |
11 | 2a599553436996 |
12 | b552013827665 |
13 | 44c918bc95653 |
14 | 1b30375731bd3 |
15 | bc1283e0c505 |
hex | 5cded372a4ed |
102112100001005 has 4 divisors (see below), whose sum is σ = 122534520001212. Its totient is φ = 81689680000800.
The previous prime is 102112100000993. The next prime is 102112100001031. The reversal of 102112100001005 is 500100001211201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 47040695738884 + 55071404262121 = 6858622^2 + 7421011^2 .
It is not a de Polignac number, because 102112100001005 - 236 = 102043380524269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10211210000096 + ... + 10211210000105.
It is an arithmetic number, because the mean of its divisors is an integer number (30633630000303).
Almost surely, 2102112100001005 is an apocalyptic number.
It is an amenable number.
102112100001005 is a deficient number, since it is larger than the sum of its proper divisors (20422420000207).
102112100001005 is an equidigital number, since it uses as much as digits as its factorization.
102112100001005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20422420000206.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 102112100001005 its reverse (500100001211201), we get a palindrome (602212101212206).
The spelling of 102112100001005 in words is "one hundred two trillion, one hundred twelve billion, one hundred million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •