Base | Representation |
---|---|
bin | 1011111101010… |
… | …10101111011000 |
3 | 20222202111001000 |
4 | 11332222233120 |
5 | 201140022242 |
6 | 13542025000 |
7 | 2325440565 |
oct | 576525730 |
9 | 228674030 |
10 | 100314072 |
11 | 516964a1 |
12 | 29718160 |
13 | 17a23751 |
14 | d47386c |
15 | 8c17a4c |
hex | 5faabd8 |
100314072 has 64 divisors (see below), whose sum is σ = 293328000. Its totient is φ = 31676832.
The previous prime is 100314041. The next prime is 100314079. The reversal of 100314072 is 270413001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100314079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8118 + ... + 16325.
It is an arithmetic number, because the mean of its divisors is an integer number (4583250).
Almost surely, 2100314072 is an apocalyptic number.
100314072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100314072 is an abundant number, since it is smaller than the sum of its proper divisors (193013928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100314072 is a wasteful number, since it uses less digits than its factorization.
100314072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24477 (or 24467 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 100314072 is about 10015.6912891722. The cubic root of 100314072 is about 464.6443065520.
Adding to 100314072 its reverse (270413001), we get a palindrome (370727073).
The spelling of 100314072 in words is "one hundred million, three hundred fourteen thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •