Base | Representation |
---|---|
bin | 10111000000110101001101… |
… | …111100011100101011110001 |
3 | 111021100210102002002122010022 |
4 | 113000311031330130223301 |
5 | 101231230102234201001 |
6 | 555132125345213225 |
7 | 30214224652260053 |
oct | 2700651574345361 |
9 | 437323362078108 |
10 | 101212212022001 |
11 | 2a2819490a9133 |
12 | b427731031215 |
13 | 446236979b772 |
14 | 1adc9a91898d3 |
15 | ba7b6665c11b |
hex | 5c0d4df1caf1 |
101212212022001 has 2 divisors, whose sum is σ = 101212212022002. Its totient is φ = 101212212022000.
The previous prime is 101212212021989. The next prime is 101212212022003. The reversal of 101212212022001 is 100220212212101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66157807725025 + 35054404296976 = 8133745^2 + 5920676^2 .
It is a cyclic number.
It is not a de Polignac number, because 101212212022001 - 26 = 101212212021937 is a prime.
Together with 101212212022003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101212212022003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606106011000 + 50606106011001.
It is an arithmetic number, because the mean of its divisors is an integer number (50606106011001).
Almost surely, 2101212212022001 is an apocalyptic number.
It is an amenable number.
101212212022001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101212212022001 is an equidigital number, since it uses as much as digits as its factorization.
101212212022001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101212212022001 its reverse (100220212212101), we get a palindrome (201432424234102).
The spelling of 101212212022001 in words is "one hundred one trillion, two hundred twelve billion, two hundred twelve million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •