Base | Representation |
---|---|
bin | 1011111011001… |
… | …00111001100000 |
3 | 20222012221121202 |
4 | 11331210321200 |
5 | 201101344000 |
6 | 13531540332 |
7 | 2323136552 |
oct | 575447140 |
9 | 228187552 |
10 | 100028000 |
11 | 51510576 |
12 | 295ba6a8 |
13 | 17953487 |
14 | d3db4d2 |
15 | 8bacdd5 |
hex | 5f64e60 |
100028000 has 96 divisors (see below), whose sum is σ = 260402688. Its totient is φ = 37632000.
The previous prime is 100027957. The next prime is 100028009. The reversal of 100028000 is 820001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100028009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67265 + ... + 68735.
It is an arithmetic number, because the mean of its divisors is an integer number (2712528).
Almost surely, 2100028000 is an apocalyptic number.
100028000 is a gapful number since it is divisible by the number (10) 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 100028000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130201344).
100028000 is an abundant number, since it is smaller than the sum of its proper divisors (160374688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100028000 is a wasteful number, since it uses less digits than its factorization.
100028000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1513 (or 1495 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
The square root of 100028000 is about 10001.3999020137. The cubic root of 100028000 is about 464.2022008143.
Adding to 100028000 its reverse (820001), we get a palindrome (100848001).
The spelling of 100028000 in words is "one hundred million, twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •