Base | Representation |
---|---|
bin | 10011000111101010000101 |
3 | 100102122022101 |
4 | 103013222011 |
5 | 2240341401 |
6 | 255232101 |
7 | 60413353 |
oct | 23075205 |
9 | 10378271 |
10 | 5012101 |
11 | 2913736 |
12 | 1818631 |
13 | 1066453 |
14 | 9467d3 |
15 | 690101 |
hex | 4c7a85 |
5012101 has 2 divisors, whose sum is σ = 5012102. Its totient is φ = 5012100.
The previous prime is 5012053. The next prime is 5012113. The reversal of 5012101 is 1012105.
It is a happy number.
5012101 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3744225 + 1267876 = 1935^2 + 1126^2 .
It is a cyclic number.
It is not a de Polignac number, because 5012101 - 27 = 5011973 is a prime.
It is an Ulam number.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5012141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2506050 + 2506051.
It is an arithmetic number, because the mean of its divisors is an integer number (2506051).
Almost surely, 25012101 is an apocalyptic number.
It is an amenable number.
5012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5012101 is an equidigital number, since it uses as much as digits as its factorization.
5012101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 10.
The square root of 5012101 is about 2238.7722081534. The cubic root of 5012101 is about 171.1354329882.
Adding to 5012101 its reverse (1012105), we get a palindrome (6024206).
The spelling of 5012101 in words is "five million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •