Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0100000000100010110 |
3 | 100120010012000122202100 |
4 | 1131020132200010112 |
5 | 3114300022444110 |
6 | 113534531222530 |
7 | 10140045462300 |
oct | 1351036400426 |
9 | 316105018670 |
10 | 100000203030 |
11 | 394565646a2 |
12 | 17469a47a46 |
13 | 9578880c90 |
14 | 4ba90b4970 |
15 | 2904279bc0 |
hex | 17487a0116 |
100000203030 has 288 divisors, whose sum is σ = 334525149504. Its totient is φ = 20528266752.
The previous prime is 100000202987. The next prime is 100000203047. The reversal of 100000203030 is 30302000001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 2097639 + ... + 2144781.
It is an arithmetic number, because the mean of its divisors is an integer number (1161545658).
Almost surely, 2100000203030 is an apocalyptic number.
100000203030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 100000203030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167262574752).
100000203030 is an abundant number, since it is smaller than the sum of its proper divisors (234524946474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000203030 is a wasteful number, since it uses less digits than its factorization.
100000203030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47220 (or 47210 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 100000203030 its reverse (30302000001), we get a palindrome (130302203031).
The spelling of 100000203030 in words is "one hundred billion, two hundred three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •