Base | Representation |
---|---|
bin | 100101000111010101000… |
… | …1110000100010010100001 |
3 | 200001122112012112222002101 |
4 | 1022032222032010102201 |
5 | 1132033302342312112 |
6 | 14503205255050401 |
7 | 1034351042360623 |
oct | 112165216042241 |
9 | 20048465488071 |
10 | 5100981994657 |
11 | 169735039879a |
12 | 6a4730670a01 |
13 | 2b0036178623 |
14 | 138c62dc8c13 |
15 | 8ca4cc82757 |
hex | 4a3aa3844a1 |
5100981994657 has 2 divisors, whose sum is σ = 5100981994658. Its totient is φ = 5100981994656.
The previous prime is 5100981994601. The next prime is 5100981994721. The reversal of 5100981994657 is 7564991890015.
It is an a-pointer prime, because the next prime (5100981994721) can be obtained adding 5100981994657 to its sum of digits (64).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4421603823121 + 679378171536 = 2102761^2 + 824244^2 .
It is a cyclic number.
It is not a de Polignac number, because 5100981994657 - 239 = 4551226180769 is a prime.
It is not a weakly prime, because it can be changed into another prime (5100981992657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2550490997328 + 2550490997329.
It is an arithmetic number, because the mean of its divisors is an integer number (2550490997329).
Almost surely, 25100981994657 is an apocalyptic number.
It is an amenable number.
5100981994657 is a deficient number, since it is larger than the sum of its proper divisors (1).
5100981994657 is an equidigital number, since it uses as much as digits as its factorization.
5100981994657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24494400, while the sum is 64.
The spelling of 5100981994657 in words is "five trillion, one hundred billion, nine hundred eighty-one million, nine hundred ninety-four thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •