Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0000100111011010111 |
3 | 100200021012111100120102 |
4 | 1132101030010323113 |
5 | 3124244322010124 |
6 | 114255550124315 |
7 | 10212220511426 |
oct | 1362114047327 |
9 | 320235440512 |
10 | 101220110039 |
11 | 39a22127904 |
12 | 1774a4b069b |
13 | 9711525449 |
14 | 4c831072bd |
15 | 29763e8aae |
hex | 1791304ed7 |
101220110039 has 2 divisors, whose sum is σ = 101220110040. Its totient is φ = 101220110038.
The previous prime is 101220109999. The next prime is 101220110077. The reversal of 101220110039 is 930011022101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101220110039 - 216 = 101220044503 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101220110039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101220110099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50610055019 + 50610055020.
It is an arithmetic number, because the mean of its divisors is an integer number (50610055020).
Almost surely, 2101220110039 is an apocalyptic number.
101220110039 is a deficient number, since it is larger than the sum of its proper divisors (1).
101220110039 is an equidigital number, since it uses as much as digits as its factorization.
101220110039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 101220110039 in words is "one hundred one billion, two hundred twenty million, one hundred ten thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •