Base | Representation |
---|---|
bin | 1011000110001101000011… |
… | …1010110100110000010001 |
3 | 1121012102110110100000211021 |
4 | 2301203100322310300101 |
5 | 3044401040310431001 |
6 | 41541054241515441 |
7 | 2366336261345104 |
oct | 261432072646021 |
9 | 47172413300737 |
10 | 12201212202001 |
11 | 3984561226339 |
12 | 1450815342b81 |
13 | 6a6752bb6144 |
14 | 302782a8873b |
15 | 1625ac9e0ba1 |
hex | b18d0eb4c11 |
12201212202001 has 2 divisors, whose sum is σ = 12201212202002. Its totient is φ = 12201212202000.
The previous prime is 12201212201963. The next prime is 12201212202013. The reversal of 12201212202001 is 10020221210221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6860213878401 + 5340998323600 = 2619201^2 + 2311060^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201212202001 - 213 = 12201212193809 is a prime.
It is not a weakly prime, because it can be changed into another prime (12201212202031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100606101000 + 6100606101001.
It is an arithmetic number, because the mean of its divisors is an integer number (6100606101001).
Almost surely, 212201212202001 is an apocalyptic number.
It is an amenable number.
12201212202001 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201212202001 is an equidigital number, since it uses as much as digits as its factorization.
12201212202001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12201212202001 its reverse (10020221210221), we get a palindrome (22221433412222).
The spelling of 12201212202001 in words is "twelve trillion, two hundred one billion, two hundred twelve million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •