Base | Representation |
---|---|
bin | 1001010001101110011000… |
… | …0000011000110110110111 |
3 | 1100010010021021210121111111 |
4 | 2110123212000120312313 |
5 | 2314104311433102244 |
6 | 33405511051015451 |
7 | 2101635156563263 |
oct | 224334600306667 |
9 | 40103237717444 |
10 | 10200111222199 |
11 | 328292a961098 |
12 | 1188a2473a587 |
13 | 58cb3551a142 |
14 | 27398bcc30a3 |
15 | 12a4dd036e34 |
hex | 946e6018db7 |
10200111222199 has 2 divisors, whose sum is σ = 10200111222200. Its totient is φ = 10200111222198.
The previous prime is 10200111222193. The next prime is 10200111222241. The reversal of 10200111222199 is 99122211100201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10200111222199 - 29 = 10200111221687 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10200111222199.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200111222193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100055611099 + 5100055611100.
It is an arithmetic number, because the mean of its divisors is an integer number (5100055611100).
Almost surely, 210200111222199 is an apocalyptic number.
10200111222199 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200111222199 is an equidigital number, since it uses as much as digits as its factorization.
10200111222199 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 31.
The spelling of 10200111222199 in words is "ten trillion, two hundred billion, one hundred eleven million, two hundred twenty-two thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •