Base | Representation |
---|---|
bin | 100110110111… |
… | …100011101000 |
3 | 201011122201120 |
4 | 212313203220 |
5 | 10102022112 |
6 | 1002215240 |
7 | 152414430 |
oct | 46674350 |
9 | 21148646 |
10 | 10189032 |
11 | 582a197 |
12 | 34b4520 |
13 | 2159919 |
14 | 14d32c0 |
15 | d63e8c |
hex | 9b78e8 |
10189032 has 32 divisors (see below), whose sum is σ = 29112000. Its totient is φ = 2911104.
The previous prime is 10189031. The next prime is 10189051. The reversal of 10189032 is 23098101.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an alternating number because its digits alternate between odd and even.
It is a junction number, because it is equal to n+sod(n) for n = 10188993 and 10189011.
It is not an unprimeable number, because it can be changed into a prime (10189031) 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, 30157 + ... + 30492.
It is an arithmetic number, because the mean of its divisors is an integer number (909750).
Almost surely, 210189032 is an apocalyptic number.
10189032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10189032 is an abundant number, since it is smaller than the sum of its proper divisors (18922968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10189032 is a wasteful number, since it uses less digits than its factorization.
10189032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60665 (or 60661 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
The square root of 10189032 is about 3192.0263156810. The cubic root of 10189032 is about 216.7925275312.
The spelling of 10189032 in words is "ten million, one hundred eighty-nine thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •