Base | Representation |
---|---|
bin | 101000111011… |
… | …001111110000 |
3 | 202012001122100 |
4 | 220323033300 |
5 | 10221302212 |
6 | 1021540400 |
7 | 160122141 |
oct | 50731760 |
9 | 22161570 |
10 | 10728432 |
11 | 6068480 |
12 | 3714700 |
13 | 22b82b0 |
14 | 15d3ac8 |
15 | e1dbdc |
hex | a3b3f0 |
10728432 has 120 divisors (see below), whose sum is σ = 35341488. Its totient is φ = 2995200.
The previous prime is 10728427. The next prime is 10728433. The reversal of 10728432 is 23482701.
It is a junction number, because it is equal to n+sod(n) for n = 10728396 and 10728405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10728433) 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 23 ways as a sum of consecutive naturals, for example, 20332 + ... + 20852.
Almost surely, 210728432 is an apocalyptic number.
10728432 is a gapful number since it is divisible by the number (12) 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 10728432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17670744).
10728432 is an abundant number, since it is smaller than the sum of its proper divisors (24613056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10728432 is a wasteful number, since it uses less digits than its factorization.
10728432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 559 (or 550 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 10728432 is about 3275.4285215831. The cubic root of 10728432 is about 220.5525504503.
The spelling of 10728432 in words is "ten million, seven hundred twenty-eight thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •