Base | Representation |
---|---|
bin | 101110100111010100… |
… | …0101001010000011000 |
3 | 100120101101102222101210 |
4 | 1131032220221100120 |
5 | 3120003000303100 |
6 | 113553101543120 |
7 | 10142441632554 |
oct | 1351650512030 |
9 | 316341388353 |
10 | 100103525400 |
11 | 394a991528a |
12 | 17498574aa0 |
13 | 95940b8a88 |
14 | 4bb8acc864 |
15 | 290d388c50 |
hex | 174ea29418 |
100103525400 has 384 divisors, whose sum is σ = 340203225600. Its totient is φ = 24261120000.
The previous prime is 100103525383. The next prime is 100103525453. The reversal of 100103525400 is 4525301001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 28509645 + ... + 28513155.
It is an arithmetic number, because the mean of its divisors is an integer number (885945900).
Almost surely, 2100103525400 is an apocalyptic number.
100103525400 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 100103525400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170101612800).
100103525400 is an abundant number, since it is smaller than the sum of its proper divisors (240099700200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100103525400 is a wasteful number, since it uses less digits than its factorization.
100103525400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3651 (or 3642 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 100103525400 its reverse (4525301001), we get a palindrome (104628826401).
The spelling of 100103525400 in words is "one hundred billion, one hundred three million, five hundred twenty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •