Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …111001001111010101100110 |
3 | 112102111221200021121002110020 |
4 | 121000313233321033111212 |
5 | 103404410033130041402 |
6 | 1025550211005540010 |
7 | 32113014453106266 |
oct | 3100675771172546 |
9 | 472457607532406 |
10 | 110011022112102 |
11 | 3206445a001151 |
12 | 10408a58874606 |
13 | 494ccc196b697 |
14 | 1d247c1b297a6 |
15 | cab98c1bd8bc |
hex | 640defe4f566 |
110011022112102 has 32 divisors (see below), whose sum is σ = 220969633996800. Its totient is φ = 36512413761600.
The previous prime is 110011022112031. The next prime is 110011022112169. The reversal of 110011022112102 is 201211220110011.
It is a happy number.
It is a super-2 number, since 2×1100110221121022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99478399 + ... + 100578197.
It is an arithmetic number, because the mean of its divisors is an integer number (6905301062400).
Almost surely, 2110011022112102 is an apocalyptic number.
110011022112102 is an abundant number, since it is smaller than the sum of its proper divisors (110958611884698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110011022112102 is a wasteful number, since it uses less digits than its factorization.
110011022112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171588.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110011022112102 its reverse (201211220110011), we get a palindrome (311222242222113).
The spelling of 110011022112102 in words is "one hundred ten trillion, eleven billion, twenty-two million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •