Base | Representation |
---|---|
bin | 110100001101001001… |
… | …0001010110010111010 |
3 | 101201101010222012000012 |
4 | 1220122102022302322 |
5 | 3314100142320442 |
6 | 123300324541522 |
7 | 11046123204110 |
oct | 1503222126272 |
9 | 351333865005 |
10 | 112110120122 |
11 | 43600270640 |
12 | 198895518a2 |
13 | a75871c1b0 |
14 | 55d7545ab0 |
15 | 2db24ad582 |
hex | 1a1a48acba |
112110120122 has 128 divisors (see below), whose sum is σ = 237962188800. Its totient is φ = 38150611200.
The previous prime is 112110120121. The next prime is 112110120131. The reversal of 112110120122 is 221021011211.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 112110120097 and 112110120106.
It is not an unprimeable number, because it can be changed into a prime (112110120121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 47888672 + ... + 47891012.
It is an arithmetic number, because the mean of its divisors is an integer number (1859079600).
Almost surely, 2112110120122 is an apocalyptic number.
112110120122 is an abundant number, since it is smaller than the sum of its proper divisors (125852068678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110120122 is a wasteful number, since it uses less digits than its factorization.
112110120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3652.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112110120122 its reverse (221021011211), we get a palindrome (333131131333).
It can be divided in two parts, 112110 and 120122, that added together give a palindrome (232232).
The spelling of 112110120122 in words is "one hundred twelve billion, one hundred ten million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •