Base | Representation |
---|---|
bin | 101000100101… |
… | …101010011100 |
3 | 202000120101010 |
4 | 220211222130 |
5 | 10210440103 |
6 | 1020015220 |
7 | 156303330 |
oct | 50455234 |
9 | 22016333 |
10 | 10640028 |
11 | 6008013 |
12 | 3691510 |
13 | 2286c99 |
14 | 15ad7c0 |
15 | e02903 |
hex | a25a9c |
10640028 has 48 divisors (see below), whose sum is σ = 30046464. Its totient is φ = 2860800.
The previous prime is 10640023. The next prime is 10640029. The reversal of 10640028 is 82004601.
It is a super-2 number, since 2×106400282 = 226420391681568, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 10639986 and 10640013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10640023) 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 in 15 ways as a sum of consecutive naturals, for example, 2298 + ... + 5153.
It is an arithmetic number, because the mean of its divisors is an integer number (625968).
Almost surely, 210640028 is an apocalyptic number.
It is an amenable number.
10640028 is an abundant number, since it is smaller than the sum of its proper divisors (19406436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10640028 is a wasteful number, since it uses less digits than its factorization.
10640028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7482 (or 7480 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 10640028 is about 3261.9055780326. The cubic root of 10640028 is about 219.9450827112.
Adding to 10640028 its reverse (82004601), we get a palindrome (92644629).
The spelling of 10640028 in words is "ten million, six hundred forty thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •