Base | Representation |
---|---|
bin | 1001011011010100… |
… | …01100001101110101 |
3 | 111001201011112201021 |
4 | 10231222030031311 |
5 | 40331104031401 |
6 | 2154110501141 |
7 | 236262544111 |
oct | 45552141565 |
9 | 14051145637 |
10 | 5061002101 |
11 | 2167892871 |
12 | b92b047b1 |
13 | 6286999cc |
14 | 360220741 |
15 | 1e94a62a1 |
hex | 12da8c375 |
5061002101 has 2 divisors, whose sum is σ = 5061002102. Its totient is φ = 5061002100.
The previous prime is 5061002071. The next prime is 5061002113. The reversal of 5061002101 is 1012001605.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4743627876 + 317374225 = 68874^2 + 17815^2 .
It is a cyclic number.
It is not a de Polignac number, because 5061002101 - 25 = 5061002069 is a prime.
It is a super-2 number, since 2×50610021012 = 51227484532652828402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5061002801) 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, 2530501050 + 2530501051.
It is an arithmetic number, because the mean of its divisors is an integer number (2530501051).
Almost surely, 25061002101 is an apocalyptic number.
It is an amenable number.
5061002101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5061002101 is an equidigital number, since it uses as much as digits as its factorization.
5061002101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 5061002101 is about 71140.7204138389. The cubic root of 5061002101 is about 1716.9019973649.
Adding to 5061002101 its reverse (1012001605), we get a palindrome (6073003706).
The spelling of 5061002101 in words is "five billion, sixty-one million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •