Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …00111111110001101000100 |
3 | 2122012111201220202000010201 |
4 | 10210221000213332031010 |
5 | 10113441012000200400 |
6 | 110434243451300244 |
7 | 4143623355644563 |
oct | 444510047761504 |
9 | 78174656660121 |
10 | 20110121100100 |
11 | 6453722100479 |
12 | 2309586a4a684 |
13 | b2b4b79014b5 |
14 | 4d7499565bda |
15 | 24d19c90006a |
hex | 124a409fe344 |
20110121100100 has 72 divisors (see below), whose sum is σ = 43782177011328. Its totient is φ = 8017673884800.
The previous prime is 20110121100079. The next prime is 20110121100127. The reversal of 20110121100100 is 100112101102.
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, 66312414 + ... + 66614986.
It is an arithmetic number, because the mean of its divisors is an integer number (608085791824).
Almost surely, 220110121100100 is an apocalyptic number.
20110121100100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110121100100 is an abundant number, since it is smaller than the sum of its proper divisors (23672055911228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110121100100 is a wasteful number, since it uses less digits than its factorization.
20110121100100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304765 (or 304758 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20110121100100 its reverse (100112101102), we get a palindrome (20210233201202).
The spelling of 20110121100100 in words is "twenty trillion, one hundred ten billion, one hundred twenty-one million, one hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •