Base | Representation |
---|---|
bin | 1011111011000… |
… | …11000100010100 |
3 | 20222012120022222 |
4 | 11331203010110 |
5 | 201101124000 |
6 | 13531441512 |
7 | 2323105646 |
oct | 575430424 |
9 | 228176288 |
10 | 100020500 |
11 | 51505978 |
12 | 295b6298 |
13 | 1794cc38 |
14 | d3d8896 |
15 | 8baaa85 |
hex | 5f63114 |
100020500 has 24 divisors (see below), whose sum is σ = 218445864. Its totient is φ = 40008000.
The previous prime is 100020499. The next prime is 100020511. The reversal of 100020500 is 5020001.
It can be written as a sum of positive squares in 4 ways, for example, as 300304 + 99720196 = 548^2 + 9986^2 .
100020500 is a modest number, since divided by 20500 gives 1000 as remainder.
It is a congruent number.
It is an unprimeable number.
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, 99521 + ... + 100520.
It is an arithmetic number, because the mean of its divisors is an integer number (9101911).
Almost surely, 2100020500 is an apocalyptic number.
100020500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100020500 is an abundant number, since it is smaller than the sum of its proper divisors (118425364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100020500 is a wasteful number, since it uses less digits than its factorization.
100020500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200060 (or 200048 counting only the distinct ones).
The product of its (nonzero) digits is 10, while the sum is 8.
The square root of 100020500 is about 10001.0249474741. The cubic root of 100020500 is about 464.1905987179.
Adding to 100020500 its reverse (5020001), we get a palindrome (105040501).
The spelling of 100020500 in words is "one hundred million, twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •