Base | Representation |
---|---|
bin | 1011000110001001010010… |
… | …1101001101111010110101 |
3 | 1121012022212001110120002011 |
4 | 2301202110231031322311 |
5 | 3044342003203031401 |
6 | 41540410113444221 |
7 | 2366302243652641 |
oct | 261422455157265 |
9 | 47168761416064 |
10 | 12200202002101 |
11 | 3984092a76193 |
12 | 1450592b70671 |
13 | 6a6621817419 |
14 | 3026c8843c21 |
15 | 16254de97451 |
hex | b1894b4deb5 |
12200202002101 has 2 divisors, whose sum is σ = 12200202002102. Its totient is φ = 12200202002100.
The previous prime is 12200202002077. The next prime is 12200202002147. The reversal of 12200202002101 is 10120020200221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11089739175876 + 1110462826225 = 3330126^2 + 1053785^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200202002101 - 27 = 12200202001973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200202002161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100101001050 + 6100101001051.
It is an arithmetic number, because the mean of its divisors is an integer number (6100101001051).
Almost surely, 212200202002101 is an apocalyptic number.
It is an amenable number.
12200202002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200202002101 is an equidigital number, since it uses as much as digits as its factorization.
12200202002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12200202002101 its reverse (10120020200221), we get a palindrome (22320222202322).
The spelling of 12200202002101 in words is "twelve trillion, two hundred billion, two hundred two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •