Base | Representation |
---|---|
bin | 1011111110011… |
… | …10011000000000 |
3 | 21000000220020221 |
4 | 11333032120000 |
5 | 201204210112 |
6 | 13545112424 |
7 | 2326616251 |
oct | 577163000 |
9 | 230026227 |
10 | 100460032 |
11 | 51786122 |
12 | 29788714 |
13 | 17a7500a |
14 | d4b0b28 |
15 | 8c45e07 |
hex | 5fce600 |
100460032 has 40 divisors (see below), whose sum is σ = 206187696. Its totient is φ = 48863232.
The previous prime is 100459993. The next prime is 100460033. The reversal of 100460032 is 230064001.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 100459988 and 100460015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100460033) 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 3 ways as a sum of consecutive naturals, for example, 16293 + ... + 21595.
Almost surely, 2100460032 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 100460032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (103093848).
100460032 is an abundant number, since it is smaller than the sum of its proper divisors (105727664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100460032 is an frugal number, since it uses more digits than its factorization.
100460032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5358 (or 5342 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 100460032 is about 10022.9752069932. The cubic root of 100460032 is about 464.8695544993.
The spelling of 100460032 in words is "one hundred million, four hundred sixty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •