Base | Representation |
---|---|
bin | 11001011111100101000110… |
… | …011100011101111111111110 |
3 | 112200222200200101122010000202 |
4 | 121133211012130131333332 |
5 | 104143443412100130420 |
6 | 1034243452055523502 |
7 | 32421332261565311 |
oct | 3137450634357776 |
9 | 480880611563022 |
10 | 112121303130110 |
11 | 327a841769102a |
12 | 106a9a39689592 |
13 | 4a73cbb9b27a1 |
14 | 1d989b2c30978 |
15 | ce67ebca3575 |
hex | 65f94671dffe |
112121303130110 has 16 divisors (see below), whose sum is σ = 201983364745056. Its totient is φ = 44811850338528.
The previous prime is 112121303130073. The next prime is 112121303130169. The reversal of 112121303130110 is 11031303121211.
It is a super-2 number, since 2×1121213031301102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4583851349 + ... + 4583875808.
It is an arithmetic number, because the mean of its divisors is an integer number (12623960296566).
Almost surely, 2112121303130110 is an apocalyptic number.
112121303130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112121303130110 is a deficient number, since it is larger than the sum of its proper divisors (89862061614946).
112121303130110 is a wasteful number, since it uses less digits than its factorization.
112121303130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9167728387.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 112121303130110 its reverse (11031303121211), we get a palindrome (123152606251321).
The spelling of 112121303130110 in words is "one hundred twelve trillion, one hundred twenty-one billion, three hundred three million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •