Base | Representation |
---|---|
bin | 10000000001100101001… |
… | …110110110100100000100 |
3 | 10220021102012221011021000 |
4 | 100001211032312210010 |
5 | 121020234231120400 |
6 | 2201520000253300 |
7 | 142363003504641 |
oct | 20014516664404 |
9 | 3807365834230 |
10 | 1101210020100 |
11 | 395025391003 |
12 | 159509011230 |
13 | 7cac769a4b8 |
14 | 3b428084dc8 |
15 | 1d9a1d1a600 |
hex | 100653b6904 |
1101210020100 has 144 divisors (see below), whose sum is σ = 3541574088640. Its totient is φ = 293540889600.
The previous prime is 1101210020087. The next prime is 1101210020111. The reversal of 1101210020100 is 10200121011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6922455 + ... + 7079745.
Almost surely, 21101210020100 is an apocalyptic number.
1101210020100 is a gapful number since it is divisible by the number (10) 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 1101210020100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1770787044320).
1101210020100 is an abundant number, since it is smaller than the sum of its proper divisors (2440364068540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101210020100 is a wasteful number, since it uses less digits than its factorization.
1101210020100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159907 (or 159894 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101210020100 its reverse (10200121011), we get a palindrome (1111410141111).
The spelling of 1101210020100 in words is "one trillion, one hundred one billion, two hundred ten million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •