Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …111010111010101101111101 |
3 | 111021001002112010111121021122 |
4 | 112333200131322322231331 |
5 | 101223232220233014044 |
6 | 555022235443040325 |
7 | 30204523620664604 |
oct | 2677403572725575 |
9 | 437032463447248 |
10 | 101121212001149 |
11 | 2a2472a0a4a62a |
12 | b411b753700a5 |
13 | 44568c6732992 |
14 | 1ad8415536a3b |
15 | ba55dc5e7dee |
hex | 5bf81debab7d |
101121212001149 has 2 divisors, whose sum is σ = 101121212001150. Its totient is φ = 101121212001148.
The previous prime is 101121212001133. The next prime is 101121212001211. The reversal of 101121212001149 is 941100212121101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 58869066973924 + 42252145027225 = 7672618^2 + 6500165^2 .
It is a cyclic number.
It is not a de Polignac number, because 101121212001149 - 24 = 101121212001133 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101121212301149) 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, 50560606000574 + 50560606000575.
It is an arithmetic number, because the mean of its divisors is an integer number (50560606000575).
Almost surely, 2101121212001149 is an apocalyptic number.
It is an amenable number.
101121212001149 is a deficient number, since it is larger than the sum of its proper divisors (1).
101121212001149 is an equidigital number, since it uses as much as digits as its factorization.
101121212001149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 26.
The spelling of 101121212001149 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twelve million, one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •