Base | Representation |
---|---|
bin | 1011111011101… |
… | …11010100110000 |
3 | 20222100210011000 |
4 | 11331313110300 |
5 | 201111302342 |
6 | 13533322000 |
7 | 2323602600 |
oct | 575672460 |
9 | 228323130 |
10 | 100103472 |
11 | 51562247 |
12 | 29636300 |
13 | 1797b931 |
14 | d41ac00 |
15 | 8bc544c |
hex | 5f77530 |
100103472 has 120 divisors (see below), whose sum is σ = 334316400. Its totient is φ = 28594944.
The previous prime is 100103461. The next prime is 100103489. The reversal of 100103472 is 274301001.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18804 + ... + 23532.
It is an arithmetic number, because the mean of its divisors is an integer number (2785970).
Almost surely, 2100103472 is an apocalyptic number.
100103472 is a gapful number since it is divisible by the number (12) 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 100103472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167158200).
100103472 is an abundant number, since it is smaller than the sum of its proper divisors (234212928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100103472 is a wasteful number, since it uses less digits than its factorization.
100103472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4760 (or 4741 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 100103472 is about 10005.1722623851. The cubic root of 100103472 is about 464.3189196696.
Adding to 100103472 its reverse (274301001), we get a palindrome (374404473).
The spelling of 100103472 in words is "one hundred million, one hundred three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •