Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …111010111010101110111011 |
3 | 111021001002112010111121100221 |
4 | 112333200131322322232323 |
5 | 101223232220233014321 |
6 | 555022235443040511 |
7 | 30204523620665023 |
oct | 2677403572725673 |
9 | 437032463447327 |
10 | 101121212001211 |
11 | 2a2472a0a4a686 |
12 | b411b75370137 |
13 | 44568c6732a0c |
14 | 1ad8415536a83 |
15 | ba55dc5e7e41 |
hex | 5bf81debabbb |
101121212001211 has 2 divisors, whose sum is σ = 101121212001212. Its totient is φ = 101121212001210.
The previous prime is 101121212001149. The next prime is 101121212001217. The reversal of 101121212001211 is 112100212121101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101121212001211 - 213 = 101121211993019 is a prime.
It is not a weakly prime, because it can be changed into another prime (101121212001217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560606000605 + 50560606000606.
It is an arithmetic number, because the mean of its divisors is an integer number (50560606000606).
Almost surely, 2101121212001211 is an apocalyptic number.
101121212001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121212001211 is an equidigital number, since it uses as much as digits as its factorization.
101121212001211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101121212001211 its reverse (112100212121101), we get a palindrome (213221424122312).
The spelling of 101121212001211 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twelve million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •