Base | Representation |
---|---|
bin | 100101000111010101000… |
… | …1110000011110011010001 |
3 | 200001122112012112212100022 |
4 | 1022032222032003303101 |
5 | 1132033302342231112 |
6 | 14503205255033225 |
7 | 1034351042352035 |
oct | 112165216036321 |
9 | 20048465485308 |
10 | 5100981992657 |
11 | 1697350397241 |
12 | 6a473066b815 |
13 | 2b0036177745 |
14 | 138c62dc81c5 |
15 | 8ca4cc81d72 |
hex | 4a3aa383cd1 |
5100981992657 has 2 divisors, whose sum is σ = 5100981992658. Its totient is φ = 5100981992656.
The previous prime is 5100981992563. The next prime is 5100981992719. The reversal of 5100981992657 is 7562991890015.
It is an a-pointer prime, because the next prime (5100981992719) can be obtained adding 5100981992657 to its sum of digits (62).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3760946547856 + 1340035444801 = 1939316^2 + 1157599^2 .
It is a cyclic number.
It is not a de Polignac number, because 5100981992657 - 216 = 5100981927121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5100981992657.
It is not a weakly prime, because it can be changed into another prime (5100981992857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550490996328 + 2550490996329.
It is an arithmetic number, because the mean of its divisors is an integer number (2550490996329).
Almost surely, 25100981992657 is an apocalyptic number.
It is an amenable number.
5100981992657 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100981992657 is an equidigital number, since it uses as much as digits as its factorization.
5100981992657 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12247200, while the sum is 62.
The spelling of 5100981992657 in words is "five trillion, one hundred billion, nine hundred eighty-one million, nine hundred ninety-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •