Base | Representation |
---|---|
bin | 1001100011110011000010… |
… | …01110110010001100101001 |
3 | 2202102121101122201002202022 |
4 | 10301321201032302030221 |
5 | 10223402410002242301 |
6 | 112413001224114225 |
7 | 4266505651062131 |
oct | 461714116621451 |
9 | 82377348632668 |
10 | 21021201212201 |
11 | 6775050076503 |
12 | 2436071905975 |
13 | b963a1a84348 |
14 | 529608313ac1 |
15 | 266c22a42d1b |
hex | 131e613b2329 |
21021201212201 has 2 divisors, whose sum is σ = 21021201212202. Its totient is φ = 21021201212200.
The previous prime is 21021201212147. The next prime is 21021201212261. The reversal of 21021201212201 is 10221210212012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12168404328976 + 8852796883225 = 3488324^2 + 2975365^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21021201212201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21021201212201.
It is not a weakly prime, because it can be changed into another prime (21021201212261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10510600606100 + 10510600606101.
It is an arithmetic number, because the mean of its divisors is an integer number (10510600606101).
Almost surely, 221021201212201 is an apocalyptic number.
It is an amenable number.
21021201212201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21021201212201 is an equidigital number, since it uses as much as digits as its factorization.
21021201212201 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 17.
Adding to 21021201212201 its reverse (10221210212012), we get a palindrome (31242411424213).
The spelling of 21021201212201 in words is "twenty-one trillion, twenty-one billion, two hundred one million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •