Base | Representation |
---|---|
bin | 100111000101… |
… | …111010111000 |
3 | 201021122102112 |
4 | 213011322320 |
5 | 10110412424 |
6 | 1003351452 |
7 | 153051104 |
oct | 47057270 |
9 | 21248375 |
10 | 10247864 |
11 | 586a410 |
12 | 3522588 |
13 | 217a633 |
14 | 150a904 |
15 | d7660e |
hex | 9c5eb8 |
10247864 has 32 divisors (see below), whose sum is σ = 21187440. Its totient is φ = 4608000.
The previous prime is 10247863. The next prime is 10247869. The reversal of 10247864 is 46874201.
It is a self number, because there is not a number n which added to its sum of digits gives 10247864.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10247863) 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 7 ways as a sum of consecutive naturals, for example, 8312 + ... + 9464.
Almost surely, 210247864 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10247864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10593720).
10247864 is an abundant number, since it is smaller than the sum of its proper divisors (10939576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10247864 is a wasteful number, since it uses less digits than its factorization.
10247864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271 (or 1267 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
The square root of 10247864 is about 3201.2285141801. The cubic root of 10247864 is about 217.2089841142.
It can be divided in two parts, 10247 and 864, that added together give a palindrome (11111).
The spelling of 10247864 in words is "ten million, two hundred forty-seven thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.384 sec. • engine limits •