Base | Representation |
---|---|
bin | 1001010001101110010101… |
… | …1001110100000101111011 |
3 | 1100010010020120202212100202 |
4 | 2110123211121310011323 |
5 | 2314104301341011024 |
6 | 33405510050152415 |
7 | 2101635004616123 |
oct | 224334531640573 |
9 | 40103216685322 |
10 | 10200101110139 |
11 | 3282925184816 |
12 | 1188a2128270b |
13 | 58cb333b9585 |
14 | 27398a80dc83 |
15 | 12a4dc1dabae |
hex | 946e567417b |
10200101110139 has 2 divisors, whose sum is σ = 10200101110140. Its totient is φ = 10200101110138.
The previous prime is 10200101110081. The next prime is 10200101110153. The reversal of 10200101110139 is 93101110100201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10200101110139 - 220 = 10200100061563 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200101110139.
It is not a weakly prime, because it can be changed into another prime (10200001110139) 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, 5100050555069 + 5100050555070.
It is an arithmetic number, because the mean of its divisors is an integer number (5100050555070).
Almost surely, 210200101110139 is an apocalyptic number.
10200101110139 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200101110139 is an equidigital number, since it uses as much as digits as its factorization.
10200101110139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 10200101110139 in words is "ten trillion, two hundred billion, one hundred one million, one hundred ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •