Base | Representation |
---|---|
bin | 11110110110011011001… |
… | …010001010100101100101 |
3 | 21111200010222102200210121 |
4 | 132312123022022211211 |
5 | 234213301113311323 |
6 | 4301531421121541 |
7 | 306111056521132 |
oct | 36663312124545 |
9 | 7450128380717 |
10 | 2120022010213 |
11 | 748107179568 |
12 | 2a2a5b0b92b1 |
13 | 124bc0186b23 |
14 | 74876ac5589 |
15 | 3a22ed7ea5d |
hex | 1ed9b28a965 |
2120022010213 has 2 divisors, whose sum is σ = 2120022010214. Its totient is φ = 2120022010212.
The previous prime is 2120022010177. The next prime is 2120022010229. The reversal of 2120022010213 is 3120102200212.
It is a happy number.
It is an a-pointer prime, because the next prime (2120022010229) can be obtained adding 2120022010213 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1237562801764 + 882459208449 = 1112458^2 + 939393^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120022010213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2120022014213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060011005106 + 1060011005107.
It is an arithmetic number, because the mean of its divisors is an integer number (1060011005107).
Almost surely, 22120022010213 is an apocalyptic number.
It is an amenable number.
2120022010213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120022010213 is an equidigital number, since it uses as much as digits as its factorization.
2120022010213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2120022010213 its reverse (3120102200212), we get a palindrome (5240124210425).
The spelling of 2120022010213 in words is "two trillion, one hundred twenty billion, twenty-two million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •