Base | Representation |
---|---|
bin | 1010111011110001110100… |
… | …0000110001011011001101 |
3 | 1120120022010211111202020101 |
4 | 2232330131000301123031 |
5 | 3033432230123000323 |
6 | 41322513202051101 |
7 | 2350365564440602 |
oct | 256743500613315 |
9 | 46508124452211 |
10 | 12022100203213 |
11 | 39155a9170661 |
12 | 1421b69049a91 |
13 | 6928aa2269c9 |
14 | 2d7c30ba46a9 |
15 | 15cac8243dad |
hex | aef1d0316cd |
12022100203213 has 2 divisors, whose sum is σ = 12022100203214. Its totient is φ = 12022100203212.
The previous prime is 12022100203207. The next prime is 12022100203261. The reversal of 12022100203213 is 31230200122021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11913080050089 + 109020153124 = 3451533^2 + 330182^2 .
It is a cyclic number.
It is not a de Polignac number, because 12022100203213 - 29 = 12022100202701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12022100203313) 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, 6011050101606 + 6011050101607.
It is an arithmetic number, because the mean of its divisors is an integer number (6011050101607).
Almost surely, 212022100203213 is an apocalyptic number.
It is an amenable number.
12022100203213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12022100203213 is an equidigital number, since it uses as much as digits as its factorization.
12022100203213 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 19.
Adding to 12022100203213 its reverse (31230200122021), we get a palindrome (43252300325234).
The spelling of 12022100203213 in words is "twelve trillion, twenty-two billion, one hundred million, two hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •