Base | Representation |
---|---|
bin | 1011111110001… |
… | …11101001010000 |
3 | 20222222111102220 |
4 | 11333013221100 |
5 | 201202314324 |
6 | 13544341040 |
7 | 2326443006 |
oct | 577075120 |
9 | 228874386 |
10 | 100432464 |
11 | 51767440 |
12 | 29774780 |
13 | 17a655c2 |
14 | d4a4a76 |
15 | 8c3cb79 |
hex | 5fc7a50 |
100432464 has 160 divisors (see below), whose sum is σ = 305980416. Its totient is φ = 28047360.
The previous prime is 100432457. The next prime is 100432469. The reversal of 100432464 is 464234001.
It is a super-2 number, since 2×1004324642 = 20173359650222592, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100432469) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 601309 + ... + 601475.
Almost surely, 2100432464 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 100432464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152990208).
100432464 is an abundant number, since it is smaller than the sum of its proper divisors (205547952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100432464 is a wasteful number, since it uses less digits than its factorization.
100432464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273 (or 267 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
The square root of 100432464 is about 10021.5998722759. The cubic root of 100432464 is about 464.8270278146.
Adding to 100432464 its reverse (464234001), we get a palindrome (564666465).
The spelling of 100432464 in words is "one hundred million, four hundred thirty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •