Base | Representation |
---|---|
bin | 100111000111… |
… | …010111101000 |
3 | 201021221120101 |
4 | 213013113220 |
5 | 10111110200 |
6 | 1003435144 |
7 | 153104314 |
oct | 47072750 |
9 | 21257511 |
10 | 10253800 |
11 | 5873917 |
12 | 3525ab4 |
13 | 218024b |
14 | 150cb44 |
15 | d7826a |
hex | 9c75e8 |
10253800 has 48 divisors (see below), whose sum is σ = 24060960. Its totient is φ = 4063680.
The previous prime is 10253797. The next prime is 10253807. The reversal of 10253800 is 835201.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (10253807) 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 11 ways as a sum of consecutive naturals, for example, 33247 + ... + 33553.
It is an arithmetic number, because the mean of its divisors is an integer number (501270).
Almost surely, 210253800 is an apocalyptic number.
10253800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10253800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12030480).
10253800 is an abundant number, since it is smaller than the sum of its proper divisors (13807160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10253800 is a wasteful number, since it uses less digits than its factorization.
10253800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490 (or 481 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 10253800 is about 3202.1555240182. The cubic root of 10253800 is about 217.2509149225.
The spelling of 10253800 in words is "ten million, two hundred fifty-three thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •