Base | Representation |
---|---|
bin | 11110000011000100100… |
… | …010011111111100011101 |
3 | 21022101211011011200222002 |
4 | 132003010202133330131 |
5 | 232312334202231112 |
6 | 4220332112332045 |
7 | 302116456454312 |
oct | 36030442377435 |
9 | 7271734150862 |
10 | 2064881680157 |
11 | 72679097145a |
12 | 294230844025 |
13 | 11c943493baa |
14 | 71d25804d09 |
15 | 38aa40b41c2 |
hex | 1e0c489ff1d |
2064881680157 has 2 divisors, whose sum is σ = 2064881680158. Its totient is φ = 2064881680156.
The previous prime is 2064881680133. The next prime is 2064881680181. The reversal of 2064881680157 is 7510861884602.
It is a balanced prime because it is at equal distance from previous prime (2064881680133) and next prime (2064881680181).
It can be written as a sum of positive squares in only one way, i.e., 1439534437636 + 625347242521 = 1199806^2 + 790789^2 .
It is a cyclic number.
It is not a de Polignac number, because 2064881680157 - 26 = 2064881680093 is a prime.
It is a super-3 number, since 3×20648816801573 (a number of 38 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2064881680187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1032440840078 + 1032440840079.
It is an arithmetic number, because the mean of its divisors is an integer number (1032440840079).
Almost surely, 22064881680157 is an apocalyptic number.
It is an amenable number.
2064881680157 is a deficient number, since it is larger than the sum of its proper divisors (1).
2064881680157 is an equidigital number, since it uses as much as digits as its factorization.
2064881680157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5160960, while the sum is 56.
The spelling of 2064881680157 in words is "two trillion, sixty-four billion, eight hundred eighty-one million, six hundred eighty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •