Base | Representation |
---|---|
bin | 1001101001010110110011… |
… | …01101111101100001010101 |
3 | 2210002212101202220101221112 |
4 | 10310223121231331201111 |
5 | 10240020042002240424 |
6 | 113040430053024405 |
7 | 4316350056224354 |
oct | 464533155754125 |
9 | 83085352811845 |
10 | 21212201211989 |
11 | 68390536462a7 |
12 | 2467097325105 |
13 | bab3c06230b8 |
14 | 534966dbd99b |
15 | 26bba0cda60e |
hex | 134ad9b7d855 |
21212201211989 has 2 divisors, whose sum is σ = 21212201211990. Its totient is φ = 21212201211988.
The previous prime is 21212201211973. The next prime is 21212201212009. The reversal of 21212201211989 is 98911210221212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15469731852964 + 5742469359025 = 3933158^2 + 2396345^2 .
It is a cyclic number.
It is not a de Polignac number, because 21212201211989 - 24 = 21212201211973 is a prime.
It is a super-2 number, since 2×212122012119892 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21212201210989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606100605994 + 10606100605995.
It is an arithmetic number, because the mean of its divisors is an integer number (10606100605995).
Almost surely, 221212201211989 is an apocalyptic number.
It is an amenable number.
21212201211989 is a deficient number, since it is larger than the sum of its proper divisors (1).
21212201211989 is an equidigital number, since it uses as much as digits as its factorization.
21212201211989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 41.
The spelling of 21212201211989 in words is "twenty-one trillion, two hundred twelve billion, two hundred one million, two hundred eleven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •