Base | Representation |
---|---|
bin | 10111001100010011001101… |
… | …100000100100000101011011 |
3 | 111101011010200110101122110112 |
4 | 113030103031200210011123 |
5 | 101332133134242223344 |
6 | 1000534145534434535 |
7 | 30325165202661326 |
oct | 2714231540440533 |
9 | 441133613348415 |
10 | 102000331211099 |
11 | 2a556108909842 |
12 | b534420662a4b |
13 | 44bb7891b53c9 |
14 | 1b28bb167b7bd |
15 | bbd3e18c3c9e |
hex | 5cc4cd82415b |
102000331211099 has 2 divisors, whose sum is σ = 102000331211100. Its totient is φ = 102000331211098.
The previous prime is 102000331211057. The next prime is 102000331211113. The reversal of 102000331211099 is 990112133000201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102000331211099 - 212 = 102000331207003 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (102000331211399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000165605549 + 51000165605550.
It is an arithmetic number, because the mean of its divisors is an integer number (51000165605550).
Almost surely, 2102000331211099 is an apocalyptic number.
102000331211099 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000331211099 is an equidigital number, since it uses as much as digits as its factorization.
102000331211099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 32.
The spelling of 102000331211099 in words is "one hundred two trillion, three hundred thirty-one million, two hundred eleven thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •