Base | Representation |
---|---|
bin | 1001100111011100… |
… | …11011010000110001 |
3 | 111022210200011201011 |
4 | 10303232123100301 |
5 | 41033132304401 |
6 | 2212144110521 |
7 | 241636603624 |
oct | 46356332061 |
9 | 14283604634 |
10 | 5162775601 |
11 | 220a2857a5 |
12 | 1001005441 |
13 | 6437b1809 |
14 | 36d953dbb |
15 | 2033ab451 |
hex | 133b9b431 |
5162775601 has 2 divisors, whose sum is σ = 5162775602. Its totient is φ = 5162775600.
The previous prime is 5162775599. The next prime is 5162775613. The reversal of 5162775601 is 1065772615.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2875640625 + 2287134976 = 53625^2 + 47824^2 .
It is a cyclic number.
It is not a de Polignac number, because 5162775601 - 21 = 5162775599 is a prime.
It is a super-2 number, since 2×51627756012 = 53308503812561822402, which contains 22 as substring.
Together with 5162775599, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5162775671) 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, 2581387800 + 2581387801.
It is an arithmetic number, because the mean of its divisors is an integer number (2581387801).
Almost surely, 25162775601 is an apocalyptic number.
It is an amenable number.
5162775601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5162775601 is an equidigital number, since it uses as much as digits as its factorization.
5162775601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 40.
The square root of 5162775601 is about 71852.4571674484. The cubic root of 5162775601 is about 1728.3343029307.
The spelling of 5162775601 in words is "five billion, one hundred sixty-two million, seven hundred seventy-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •