Base | Representation |
---|---|
bin | 1011000110001101000001… |
… | …0100110000001111000101 |
3 | 1121012102102202112222212101 |
4 | 2301203100110300033011 |
5 | 3044401030232101041 |
6 | 41541053243552101 |
7 | 2366336110461001 |
oct | 261432024601705 |
9 | 47172382488771 |
10 | 12201202222021 |
11 | 398455662a21a |
12 | 1450811b2b631 |
13 | 6a6750b00727 |
14 | 30278160b701 |
15 | 1625abbbdb31 |
hex | b18d05303c5 |
12201202222021 has 2 divisors, whose sum is σ = 12201202222022. Its totient is φ = 12201202222020.
The previous prime is 12201202222009. The next prime is 12201202222031. The reversal of 12201202222021 is 12022220210221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8826306228100 + 3374895993921 = 2970910^2 + 1837089^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201202222021 - 229 = 12200665351109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12201202222021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12201202222031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100601111010 + 6100601111011.
It is an arithmetic number, because the mean of its divisors is an integer number (6100601111011).
Almost surely, 212201202222021 is an apocalyptic number.
It is an amenable number.
12201202222021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201202222021 is an equidigital number, since it uses as much as digits as its factorization.
12201202222021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 12201202222021 its reverse (12022220210221), we get a palindrome (24223422432242).
The spelling of 12201202222021 in words is "twelve trillion, two hundred one billion, two hundred two million, two hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •