Base | Representation |
---|---|
bin | 10010101110111011… |
… | …001111000110001100 |
3 | 1220220211020020022010 |
4 | 102232323033012030 |
5 | 312143321224400 |
6 | 13123542221220 |
7 | 1311313363122 |
oct | 225673170614 |
9 | 56824206263 |
10 | 20114633100 |
11 | 8592205621 |
12 | 3a94424810 |
13 | 1b87372a83 |
14 | d8b605912 |
15 | 7cad61450 |
hex | 4aeecf18c |
20114633100 has 144 divisors (see below), whose sum is σ = 61857985280. Its totient is φ = 5032108800.
The previous prime is 20114633093. The next prime is 20114633101. The reversal of 20114633100 is 133641102.
It is a super-2 number, since 2×201146331002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20114633101) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 569970 + ... + 604230.
Almost surely, 220114633100 is an apocalyptic number.
20114633100 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 20114633100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30928992640).
20114633100 is an abundant number, since it is smaller than the sum of its proper divisors (41743352180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20114633100 is a wasteful number, since it uses less digits than its factorization.
20114633100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34400 (or 34393 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
The spelling of 20114633100 in words is "twenty billion, one hundred fourteen million, six hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •