Base | Representation |
---|---|
bin | 10011001011010011001110 |
3 | 100110101210000 |
4 | 103023103032 |
5 | 2241331042 |
6 | 255425130 |
7 | 60505020 |
oct | 23132316 |
9 | 10411700 |
10 | 5027022 |
11 | 2923970 |
12 | 18251a6 |
13 | 1070190 |
14 | 94c010 |
15 | 69474c |
hex | 4cb4ce |
5027022 has 160 divisors (see below), whose sum is σ = 15611904. Its totient is φ = 1166400.
The previous prime is 5027021. The next prime is 5027023. The reversal of 5027022 is 2207205.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5027021) and next prime (5027023).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 5026986 and 5027004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5027021) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 162147 + ... + 162177.
Almost surely, 25027022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5027022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7805952).
5027022 is an abundant number, since it is smaller than the sum of its proper divisors (10584882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5027022 is a wasteful number, since it uses less digits than its factorization.
5027022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76 (or 67 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 5027022 is about 2242.1021386190. The cubic root of 5027022 is about 171.3050878593.
It can be divided in two parts, 50 and 27022, that added together give a palindrome (27072).
The spelling of 5027022 in words is "five million, twenty-seven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •