Base | Representation |
---|---|
bin | 10011000111011100001111 |
3 | 100102121002120 |
4 | 103013130033 |
5 | 2240324330 |
6 | 255224023 |
7 | 60410646 |
oct | 23073417 |
9 | 10377076 |
10 | 5011215 |
11 | 2913000 |
12 | 1818013 |
13 | 1065c21 |
14 | 94635d |
15 | 68ec10 |
hex | 4c770f |
5011215 has 32 divisors (see below), whose sum is σ = 8854272. Its totient is φ = 2420000.
The previous prime is 5011213. The next prime is 5011249. The reversal of 5011215 is 5121105.
It is not a de Polignac number, because 5011215 - 21 = 5011213 is a prime.
It is a super-2 number, since 2×50112152 = 50224551552450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 5011194 and 5011203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19840 + ... + 20090.
It is an arithmetic number, because the mean of its divisors is an integer number (276696).
Almost surely, 25011215 is an apocalyptic number.
5011215 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5011215 is a deficient number, since it is larger than the sum of its proper divisors (3843057).
5011215 is a wasteful number, since it uses less digits than its factorization.
5011215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292 (or 270 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 5011215 is about 2238.5743230905. The cubic root of 5011215 is about 171.1253483996.
The spelling of 5011215 in words is "five million, eleven thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •