Base | Representation |
---|---|
bin | 10010101110110001… |
… | …111101010110001100 |
3 | 1220220122122200020001 |
4 | 102232301331112030 |
5 | 312142210413400 |
6 | 13123414134044 |
7 | 1311253613545 |
oct | 225661752614 |
9 | 56818580201 |
10 | 20112201100 |
11 | 85908a4402 |
12 | 3a93651324 |
13 | 1b86a00b14 |
14 | d8b1714cc |
15 | 7caa30a6a |
hex | 4aec7d58c |
20112201100 has 72 divisors (see below), whose sum is σ = 45983168000. Its totient is φ = 7614388800.
The previous prime is 20112201089. The next prime is 20112201139. The reversal of 20112201100 is 110221102.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 23 ways as a sum of consecutive naturals, for example, 2334601 + ... + 2343199.
Almost surely, 220112201100 is an apocalyptic number.
20112201100 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 20112201100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22991584000).
20112201100 is an abundant number, since it is smaller than the sum of its proper divisors (25870966900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112201100 is a wasteful number, since it uses less digits than its factorization.
20112201100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9863 (or 9856 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20112201100 its reverse (110221102), we get a palindrome (20222422202).
The spelling of 20112201100 in words is "twenty billion, one hundred twelve million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •