Base | Representation |
---|---|
bin | 1001100111001000… |
… | …01110000010101101 |
3 | 111022121122020111022 |
4 | 10303210032002231 |
5 | 41031441200023 |
6 | 2212010503525 |
7 | 241605061235 |
oct | 46344160255 |
9 | 14277566438 |
10 | 5160100013 |
11 | 2208818572 |
12 | 1000134ba5 |
13 | 643085a23 |
14 | 36d458cc5 |
15 | 20302d7c8 |
hex | 13390e0ad |
5160100013 has 2 divisors, whose sum is σ = 5160100014. Its totient is φ = 5160100012.
The previous prime is 5160099961. The next prime is 5160100021. The reversal of 5160100013 is 3100010615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4933236169 + 226863844 = 70237^2 + 15062^2 .
It is a cyclic number.
It is not a de Polignac number, because 5160100013 - 226 = 5092991149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5160099964 and 5160100000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5160100513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580050006 + 2580050007.
It is an arithmetic number, because the mean of its divisors is an integer number (2580050007).
Almost surely, 25160100013 is an apocalyptic number.
It is an amenable number.
5160100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160100013 is an equidigital number, since it uses as much as digits as its factorization.
5160100013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 5160100013 is about 71833.8361289441. The cubic root of 5160100013 is about 1728.0356838705.
Adding to 5160100013 its reverse (3100010615), we get a palindrome (8260110628).
The spelling of 5160100013 in words is "five billion, one hundred sixty million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •