Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00110100111100101100100 |
3 | 2122012201002212122222011111 |
4 | 10210222330212213211210 |
5 | 10114004241441320400 |
6 | 110435230113314404 |
7 | 4144026043555045 |
oct | 444527446474544 |
9 | 78181085588144 |
10 | 20112201120100 |
11 | 645459a232271 |
12 | 2309a67565a04 |
13 | b2b75981506b |
14 | 4d76158d08cc |
15 | 24d27031c3ba |
hex | 124abc9a7964 |
20112201120100 has 18 divisors (see below), whose sum is σ = 43643476430834. Its totient is φ = 8044880448000.
The previous prime is 20112201120041. The next prime is 20112201120173. The reversal of 20112201120100 is 102110221102.
It can be written as a sum of positive squares in 3 ways, for example, as 215088178176 + 19897112941924 = 463776^2 + 4460618^2 .
It is a super-3 number, since 3×201122011201003 (a number of 41 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 100561005501 + ... + 100561005700.
Almost surely, 220112201120100 is an apocalyptic number.
20112201120100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112201120100 is an abundant number, since it is smaller than the sum of its proper divisors (23531275310734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112201120100 is a wasteful number, since it uses less digits than its factorization.
20112201120100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201122011215 (or 201122011208 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20112201120100 its reverse (102110221102), we get a palindrome (20214311341202).
The spelling of 20112201120100 in words is "twenty trillion, one hundred twelve billion, two hundred one million, one hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •