Base | Representation |
---|---|
bin | 11001000010010101111111… |
… | …010010110101010110011100 |
3 | 112102212121212101121201121121 |
4 | 121002111333102311112130 |
5 | 103413034302311223400 |
6 | 1030104504004540324 |
7 | 32123226160545211 |
oct | 3102257722652634 |
9 | 472777771551547 |
10 | 110112212211100 |
11 | 320a33661a0240 |
12 | 104245990b16a4 |
13 | 49596c9bb6ac8 |
14 | 1d29660c5db08 |
15 | cae410b3a21a |
hex | 64257f4b559c |
110112212211100 has 72 divisors (see below), whose sum is σ = 260805259145088. Its totient is φ = 40019357092800.
The previous prime is 110112212210999. The next prime is 110112212211107. The reversal of 110112212211100 is 1112212211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110112212211107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24754552 + ... + 28861951.
It is an arithmetic number, because the mean of its divisors is an integer number (3622295265904).
Almost surely, 2110112212211100 is an apocalyptic number.
110112212211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110112212211100 is an abundant number, since it is smaller than the sum of its proper divisors (150693046933988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112212211100 is a wasteful number, since it uses less digits than its factorization.
110112212211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53618395 (or 53618388 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110112212211100 its reverse (1112212211011), we get a palindrome (111224424422111).
The spelling of 110112212211100 in words is "one hundred ten trillion, one hundred twelve billion, two hundred twelve million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •