Base | Representation |
---|---|
bin | 10010111011110000… |
… | …110010111011100100 |
3 | 1221110211111000021200 |
4 | 102323300302323210 |
5 | 313113440000400 |
6 | 13201154242500 |
7 | 1316540102214 |
oct | 227360627344 |
9 | 57424430250 |
10 | 20330000100 |
11 | 8692833a83 |
12 | 3b34586430 |
13 | 1bbcb7a777 |
14 | dac068244 |
15 | 7dec03b00 |
hex | 4bbc32ee4 |
20330000100 has 216 divisors, whose sum is σ = 65388523200. Its totient is φ = 5280387840.
The previous prime is 20330000099. The next prime is 20330000129. The reversal of 20330000100 is 100003302.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 23180862 + ... + 23181738.
Almost surely, 220330000100 is an apocalyptic number.
20330000100 is a gapful number since it is divisible by the number (20) 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 20330000100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32694261600).
20330000100 is an abundant number, since it is smaller than the sum of its proper divisors (45058523100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20330000100 is a wasteful number, since it uses less digits than its factorization.
20330000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1539 (or 1529 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 9.
Adding to 20330000100 its reverse (100003302), we get a palindrome (20430003402).
The spelling of 20330000100 in words is "twenty billion, three hundred thirty million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •