Base | Representation |
---|---|
bin | 1011000110001001010101… |
… | …0111101000100011000101 |
3 | 1121012022212211101110122102 |
4 | 2301202111113220203011 |
5 | 3044342014024334341 |
6 | 41540411152041445 |
7 | 2366302440323126 |
oct | 261422527504305 |
9 | 47168784343572 |
10 | 12200213121221 |
11 | 3984099280144 |
12 | 1450596833285 |
13 | 6a6623c0b498 |
14 | 3026ca0da04d |
15 | 16254ee41c9b |
hex | b18955e88c5 |
12200213121221 has 2 divisors, whose sum is σ = 12200213121222. Its totient is φ = 12200213121220.
The previous prime is 12200213121209. The next prime is 12200213121247. The reversal of 12200213121221 is 12212131200221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12116177488900 + 84035632321 = 3480830^2 + 289889^2 .
It is a cyclic number.
It is not a de Polignac number, because 12200213121221 - 210 = 12200213120197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12200213121193 and 12200213121202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12200213151221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100106560610 + 6100106560611.
It is an arithmetic number, because the mean of its divisors is an integer number (6100106560611).
Almost surely, 212200213121221 is an apocalyptic number.
It is an amenable number.
12200213121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200213121221 is an equidigital number, since it uses as much as digits as its factorization.
12200213121221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12200213121221 its reverse (12212131200221), we get a palindrome (24412344321442).
The spelling of 12200213121221 in words is "twelve trillion, two hundred billion, two hundred thirteen million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •