Base | Representation |
---|---|
bin | 1001101001010010111011… |
… | …01111011011100000111001 |
3 | 2210002200000211000222100201 |
4 | 10310221131233123200321 |
5 | 10240001312013102301 |
6 | 113035443431402201 |
7 | 4316244401501242 |
oct | 464513557334071 |
9 | 83080024028321 |
10 | 21210121222201 |
11 | 683818653517a |
12 | 24667b6823361 |
13 | bab14b720202 |
14 | 53480aa61cc9 |
15 | 26bacd3c7201 |
hex | 134a5dbdb839 |
21210121222201 has 2 divisors, whose sum is σ = 21210121222202. Its totient is φ = 21210121222200.
The previous prime is 21210121222193. The next prime is 21210121222207. The reversal of 21210121222201 is 10222212101212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21130202497600 + 79918724601 = 4596760^2 + 282699^2 .
It is a cyclic number.
It is not a de Polignac number, because 21210121222201 - 23 = 21210121222193 is a prime.
It is a super-2 number, since 2×212101212222012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21210121222207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605060611100 + 10605060611101.
It is an arithmetic number, because the mean of its divisors is an integer number (10605060611101).
Almost surely, 221210121222201 is an apocalyptic number.
It is an amenable number.
21210121222201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210121222201 is an equidigital number, since it uses as much as digits as its factorization.
21210121222201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21210121222201 its reverse (10222212101212), we get a palindrome (31432333323413).
The spelling of 21210121222201 in words is "twenty-one trillion, two hundred ten billion, one hundred twenty-one million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •