Base | Representation |
---|---|
bin | 10111000000101011110011… |
… | …010010011000110100101011 |
3 | 111021022211022102122012020002 |
4 | 113000223303102120310223 |
5 | 101231043400341041412 |
6 | 555123334201253215 |
7 | 30213416260043462 |
oct | 2700536322306453 |
9 | 437284272565202 |
10 | 101202101112107 |
11 | 2a27862a820956 |
12 | b42578aa9420b |
13 | 4461417b1aa48 |
14 | 1adc2ca3d59d9 |
15 | ba7773b91dc2 |
hex | 5c0af3498d2b |
101202101112107 has 2 divisors, whose sum is σ = 101202101112108. Its totient is φ = 101202101112106.
The previous prime is 101202101112103. The next prime is 101202101112127. The reversal of 101202101112107 is 701211101202101.
It is a happy number.
It is an a-pointer prime, because the next prime (101202101112127) can be obtained adding 101202101112107 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101202101112107 - 22 = 101202101112103 is a prime.
It is not a weakly prime, because it can be changed into another prime (101202101112103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50601050556053 + 50601050556054.
It is an arithmetic number, because the mean of its divisors is an integer number (50601050556054).
Almost surely, 2101202101112107 is an apocalyptic number.
101202101112107 is a deficient number, since it is larger than the sum of its proper divisors (1).
101202101112107 is an equidigital number, since it uses as much as digits as its factorization.
101202101112107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 101202101112107 its reverse (701211101202101), we get a palindrome (802413202314208).
The spelling of 101202101112107 in words is "one hundred one trillion, two hundred two billion, one hundred one million, one hundred twelve thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •