Base | Representation |
---|---|
bin | 10111000000110100001100… |
… | …011000001111000100000111 |
3 | 111021100200120102020020022202 |
4 | 113000310030120033010013 |
5 | 101231220324133304431 |
6 | 555131424252145115 |
7 | 30214155464314004 |
oct | 2700641430170407 |
9 | 437320512206282 |
10 | 101211112009991 |
11 | 2a2814341858a5 |
12 | b42748476819b |
13 | 4462222915499 |
14 | 1adc9030468ab |
15 | ba7aeecc28cb |
hex | 5c0d0c60f107 |
101211112009991 has 2 divisors, whose sum is σ = 101211112009992. Its totient is φ = 101211112009990.
The previous prime is 101211112009961. The next prime is 101211112010003. The reversal of 101211112009991 is 199900211112101.
It is a strong prime.
It is an emirp because it is prime and its reverse (199900211112101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101211112009991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101211112009951) 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, 50605556004995 + 50605556004996.
It is an arithmetic number, because the mean of its divisors is an integer number (50605556004996).
Almost surely, 2101211112009991 is an apocalyptic number.
101211112009991 is a deficient number, since it is larger than the sum of its proper divisors (1).
101211112009991 is an equidigital number, since it uses as much as digits as its factorization.
101211112009991 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 38.
The spelling of 101211112009991 in words is "one hundred one trillion, two hundred eleven billion, one hundred twelve million, nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •