Base | Representation |
---|---|
bin | 11101110001011101100… |
… | …111101111001010010001 |
3 | 21020121000112011110222011 |
4 | 131301131213233022101 |
5 | 232010124113141034 |
6 | 4203524043342521 |
7 | 300550112445133 |
oct | 35613547571221 |
9 | 7217015143864 |
10 | 2045975130769 |
11 | 719769694029 |
12 | 290634b21a41 |
13 | 11ac1c4b5b6b |
14 | 71050835053 |
15 | 38349338864 |
hex | 1dc5d9ef291 |
2045975130769 has 2 divisors, whose sum is σ = 2045975130770. Its totient is φ = 2045975130768.
The previous prime is 2045975130757. The next prime is 2045975130827. The reversal of 2045975130769 is 9670315795402.
It is a happy number.
It is an a-pointer prime, because the next prime (2045975130827) can be obtained adding 2045975130769 to its sum of digits (58).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1918258240144 + 127716890625 = 1385012^2 + 357375^2 .
It is a cyclic number.
It is not a de Polignac number, because 2045975130769 - 229 = 2045438259857 is a prime.
It is a super-2 number, since 2×20459751307692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2045975130169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1022987565384 + 1022987565385.
It is an arithmetic number, because the mean of its divisors is an integer number (1022987565385).
Almost surely, 22045975130769 is an apocalyptic number.
It is an amenable number.
2045975130769 is a deficient number, since it is larger than the sum of its proper divisors (1).
2045975130769 is an equidigital number, since it uses as much as digits as its factorization.
2045975130769 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14288400, while the sum is 58.
The spelling of 2045975130769 in words is "two trillion, forty-five billion, nine hundred seventy-five million, one hundred thirty thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •