Base | Representation |
---|---|
bin | 10011100000011100110010 |
3 | 100121210121110 |
4 | 103200130302 |
5 | 2302114100 |
6 | 301334150 |
7 | 61315413 |
oct | 23403462 |
9 | 10553543 |
10 | 5113650 |
11 | 2982a63 |
12 | 1867356 |
13 | 10a0739 |
14 | 97180a |
15 | 6b0250 |
hex | 4e0732 |
5113650 has 48 divisors (see below), whose sum is σ = 12883104. Its totient is φ = 1342080.
The previous prime is 5113649. The next prime is 5113681. The reversal of 5113650 is 563115.
Added to its reverse (563115) it gives a triangular number (5676765 = T3369).
It is a happy number.
It is a super-2 number, since 2×51136502 = 52298832645000, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10717 + ... + 11183.
It is an arithmetic number, because the mean of its divisors is an integer number (268398).
Almost surely, 25113650 is an apocalyptic number.
5113650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 5113650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6441552).
5113650 is an abundant number, since it is smaller than the sum of its proper divisors (7769454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5113650 is a wasteful number, since it uses less digits than its factorization.
5113650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 555 (or 550 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 5113650 is about 2261.3380994447. The cubic root of 5113650 is about 172.2834922863.
Adding to 5113650 its reverse (563115), we get a palindrome (5676765).
The spelling of 5113650 in words is "five million, one hundred thirteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •