Base | Representation |
---|---|
bin | 1001100111010100… |
… | …10100011010000011 |
3 | 111022201122110211002 |
4 | 10303222110122003 |
5 | 41032343331242 |
6 | 2212105042215 |
7 | 241624500656 |
oct | 46352243203 |
9 | 14281573732 |
10 | 5161698947 |
11 | 220970a8a9 |
12 | 100078636b |
13 | 6434c5742 |
14 | 36d75389d |
15 | 203247432 |
hex | 133a94683 |
5161698947 has 2 divisors, whose sum is σ = 5161698948. Its totient is φ = 5161698946.
The previous prime is 5161698943. The next prime is 5161699003. The reversal of 5161698947 is 7498961615.
It is an a-pointer prime, because the next prime (5161699003) can be obtained adding 5161698947 to its sum of digits (56).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5161698947 - 22 = 5161698943 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5161698892 and 5161698901.
It is not a weakly prime, because it can be changed into another prime (5161698943) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2580849473 + 2580849474.
It is an arithmetic number, because the mean of its divisors is an integer number (2580849474).
Almost surely, 25161698947 is an apocalyptic number.
5161698947 is a deficient number, since it is larger than the sum of its proper divisors (1).
5161698947 is an equidigital number, since it uses as much as digits as its factorization.
5161698947 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3265920, while the sum is 56.
The square root of 5161698947 is about 71844.9646600233. The cubic root of 5161698947 is about 1728.2141513203.
The spelling of 5161698947 in words is "five billion, one hundred sixty-one million, six hundred ninety-eight thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •