Base | Representation |
---|---|
bin | 11110110110011101100… |
… | …100001111011001000101 |
3 | 21111200020210102201021012 |
4 | 132312131210033121011 |
5 | 234213341433300234 |
6 | 4301535422532005 |
7 | 306112060031615 |
oct | 36663544173105 |
9 | 7450223381235 |
10 | 2120062400069 |
11 | 748127a56009 |
12 | 2a2a70737005 |
13 | 124bc8658c53 |
14 | 7487c1daa45 |
15 | 3a2336ac0ce |
hex | 1ed9d90f645 |
2120062400069 has 2 divisors, whose sum is σ = 2120062400070. Its totient is φ = 2120062400068.
The previous prime is 2120062400051. The next prime is 2120062400081. The reversal of 2120062400069 is 9600042600212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1594891152100 + 525171247969 = 1262890^2 + 724687^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120062400069 - 28 = 2120062399813 is a prime.
It is a super-2 number, since 2×21200624000692 (a number of 25 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 (2120062400009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060031200034 + 1060031200035.
It is an arithmetic number, because the mean of its divisors is an integer number (1060031200035).
Almost surely, 22120062400069 is an apocalyptic number.
It is an amenable number.
2120062400069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2120062400069 is an equidigital number, since it uses as much as digits as its factorization.
2120062400069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 2120062400069 in words is "two trillion, one hundred twenty billion, sixty-two million, four hundred thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.580 sec. • engine limits •