Base | Representation |
---|---|
bin | 11110110110011111110… |
… | …100100001010100111101 |
3 | 21111200100102121021120102 |
4 | 132312133310201110331 |
5 | 234213431124103034 |
6 | 4301543253330445 |
7 | 306113026356461 |
oct | 36663764412475 |
9 | 7450312537512 |
10 | 2120100222269 |
11 | 748147339427 |
12 | 2a2a81336a25 |
13 | 124c0343c453 |
14 | 748832444a1 |
15 | 3a236b7d97e |
hex | 1ed9fd2153d |
2120100222269 has 2 divisors, whose sum is σ = 2120100222270. Its totient is φ = 2120100222268.
The previous prime is 2120100222211. The next prime is 2120100222271. The reversal of 2120100222269 is 9622220010212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1500318765625 + 619781456644 = 1224875^2 + 787262^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120100222269 - 28 = 2120100222013 is a prime.
It is a super-2 number, since 2×21201002222692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 2120100222271, it forms a pair of twin primes.
It is a Chen 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 (2120100222299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060050111134 + 1060050111135.
It is an arithmetic number, because the mean of its divisors is an integer number (1060050111135).
Almost surely, 22120100222269 is an apocalyptic number.
It is an amenable number.
2120100222269 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120100222269 is an equidigital number, since it uses as much as digits as its factorization.
2120100222269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 2120100222269 in words is "two trillion, one hundred twenty billion, one hundred million, two hundred twenty-two thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •