Base | Representation |
---|---|
bin | 11001000000110111110101… |
… | …010000100101111100100110 |
3 | 112102111221220112221222012212 |
4 | 121000313311100211330212 |
5 | 103404410224200320402 |
6 | 1025550223543043422 |
7 | 32113016625134264 |
oct | 3100676520457446 |
9 | 472457815858185 |
10 | 110011112120102 |
11 | 320644a5898526 |
12 | 10408a82a40572 |
13 | 49500074c415b |
14 | 1d247cda79434 |
15 | cab99504c952 |
hex | 640df5425f26 |
110011112120102 has 8 divisors (see below), whose sum is σ = 165234655855056. Its totient is φ = 54932893501752.
The previous prime is 110011112120071. The next prime is 110011112120131. The reversal of 110011112120102 is 201021211110011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100111121201022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36331277258 + ... + 36331280285.
It is an arithmetic number, because the mean of its divisors is an integer number (20654331981882).
Almost surely, 2110011112120102 is an apocalyptic number.
110011112120102 is a deficient number, since it is larger than the sum of its proper divisors (55223543734954).
110011112120102 is an equidigital number, since it uses as much as digits as its factorization.
110011112120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72662558302.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110011112120102 its reverse (201021211110011), we get a palindrome (311032323230113).
The spelling of 110011112120102 in words is "one hundred ten trillion, eleven billion, one hundred twelve million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •