Base | Representation |
---|---|
bin | 11101101011111100100… |
… | …101100100110010110001 |
3 | 21020000201202010202200121 |
4 | 131223330211210302301 |
5 | 231411011331104034 |
6 | 4201104222450241 |
7 | 300250252434133 |
oct | 35537445446261 |
9 | 7200652122617 |
10 | 2040052206769 |
11 | 7171aa317615 |
12 | 28b461433981 |
13 | 11a4b73955c5 |
14 | 70a4bd6b053 |
15 | 380ee3781b4 |
hex | 1dafc964cb1 |
2040052206769 has 2 divisors, whose sum is σ = 2040052206770. Its totient is φ = 2040052206768.
The previous prime is 2040052206767. The next prime is 2040052206791. The reversal of 2040052206769 is 9676022500402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1751554312369 + 288497894400 = 1323463^2 + 537120^2 .
It is a cyclic number.
It is not a de Polignac number, because 2040052206769 - 21 = 2040052206767 is a prime.
It is a super-2 number, since 2×20400522067692 (a number of 25 digits) contains 22 as substring.
Together with 2040052206767, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2040052206761) 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, 1020026103384 + 1020026103385.
It is an arithmetic number, because the mean of its divisors is an integer number (1020026103385).
Almost surely, 22040052206769 is an apocalyptic number.
It is an amenable number.
2040052206769 is a deficient number, since it is larger than the sum of its proper divisors (1).
2040052206769 is an equidigital number, since it uses as much as digits as its factorization.
2040052206769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 2040052206769 in words is "two trillion, forty billion, fifty-two million, two hundred six thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •