Base | Representation |
---|---|
bin | 100101001001100000011… |
… | …0010011111110001101101 |
3 | 200002002120220210020201121 |
4 | 1022103000302133301231 |
5 | 1132122340314013402 |
6 | 14505301130540541 |
7 | 1034604622430002 |
oct | 112230062376155 |
9 | 20062526706647 |
10 | 5105655610477 |
11 | 1699329540504 |
12 | 6a5615897751 |
13 | 2b05cc4cc186 |
14 | 1391879a98a9 |
15 | 8cc23217837 |
hex | 4a4c0c9fc6d |
5105655610477 has 2 divisors, whose sum is σ = 5105655610478. Its totient is φ = 5105655610476.
The previous prime is 5105655610423. The next prime is 5105655610519. The reversal of 5105655610477 is 7740165565015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5053778259721 + 51877350756 = 2248061^2 + 227766^2 .
It is a cyclic number.
It is not a de Polignac number, because 5105655610477 - 235 = 5071295872109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5105655610777) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2552827805238 + 2552827805239.
It is an arithmetic number, because the mean of its divisors is an integer number (2552827805239).
Almost surely, 25105655610477 is an apocalyptic number.
It is an amenable number.
5105655610477 is a deficient number, since it is larger than the sum of its proper divisors (1).
5105655610477 is an equidigital number, since it uses as much as digits as its factorization.
5105655610477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4410000, while the sum is 52.
The spelling of 5105655610477 in words is "five trillion, one hundred five billion, six hundred fifty-five million, six hundred ten thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •