Base | Representation |
---|---|
bin | 1011000110001101000101… |
… | …1101001100001110010101 |
3 | 1121012102111002021201212222 |
4 | 2301203101131030032111 |
5 | 3044401100112223104 |
6 | 41541055202552125 |
7 | 2366336431046354 |
oct | 261432135141625 |
9 | 47172432251788 |
10 | 12201221211029 |
11 | 3984566319a14 |
12 | 1450818368645 |
13 | 6a6754a1b926 |
14 | 302783d5199b |
15 | 1625ad6c01be |
hex | b18d174c395 |
12201221211029 has 2 divisors, whose sum is σ = 12201221211030. Its totient is φ = 12201221211028.
The previous prime is 12201221210953. The next prime is 12201221211059. The reversal of 12201221211029 is 92011212210221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7401936422500 + 4799284788529 = 2720650^2 + 2190727^2 .
It is an emirp because it is prime and its reverse (92011212210221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12201221211029 - 224 = 12201204433813 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12201221210989 and 12201221211007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12201221211059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100610605514 + 6100610605515.
It is an arithmetic number, because the mean of its divisors is an integer number (6100610605515).
Almost surely, 212201221211029 is an apocalyptic number.
It is an amenable number.
12201221211029 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201221211029 is an equidigital number, since it uses as much as digits as its factorization.
12201221211029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 12201221211029 in words is "twelve trillion, two hundred one billion, two hundred twenty-one million, two hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •