Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …00000111010100000001100 |
3 | 2121212001010222022002020001 |
4 | 10203030302200322200030 |
5 | 10110330213112333400 |
6 | 110320550020134044 |
7 | 4133516500342654 |
oct | 443146240724014 |
9 | 77761128262201 |
10 | 20011100121100 |
11 | 641572936a340 |
12 | 22b2350b37324 |
13 | b22066b9502a |
14 | 4d2784551364 |
15 | 24a804600a6a |
hex | 12333283a80c |
20011100121100 has 72 divisors (see below), whose sum is σ = 47814458303808. Its totient is φ = 7208756500800.
The previous prime is 20011100121079. The next prime is 20011100121127. The reversal of 20011100121100 is 112100111002.
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 (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 84891222 + ... + 85126621.
It is an arithmetic number, because the mean of its divisors is an integer number (664089698664).
Almost surely, 220011100121100 is an apocalyptic number.
20011100121100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20011100121100 is an abundant number, since it is smaller than the sum of its proper divisors (27803358182708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20011100121100 is a wasteful number, since it uses less digits than its factorization.
20011100121100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170017975 (or 170017968 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20011100121100 its reverse (112100111002), we get a palindrome (20123200232102).
The spelling of 20011100121100 in words is "twenty trillion, eleven billion, one hundred million, one hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •