Base | Representation |
---|---|
bin | 110100001010011101… |
… | …0110001010000001111 |
3 | 101201010212120200202201 |
4 | 1220110322301100033 |
5 | 3313404121200421 |
6 | 123243351302331 |
7 | 11043651066103 |
oct | 1502472612017 |
9 | 351125520681 |
10 | 112020100111 |
11 | 43564476237 |
12 | 1986337a9a7 |
13 | a742b9110a |
14 | 55c95d1903 |
15 | 2da962ab91 |
hex | 1a14eb140f |
112020100111 has 8 divisors (see below), whose sum is σ = 112152360320. Its totient is φ = 111887899992.
The previous prime is 112020100109. The next prime is 112020100133. The reversal of 112020100111 is 111001020211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112020100111 - 21 = 112020100109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020104111) 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 7 ways as a sum of consecutive naturals, for example, 4482910 + ... + 4507828.
It is an arithmetic number, because the mean of its divisors is an integer number (14019045040).
Almost surely, 2112020100111 is an apocalyptic number.
112020100111 is a deficient number, since it is larger than the sum of its proper divisors (132260209).
112020100111 is a wasteful number, since it uses less digits than its factorization.
112020100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30045.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 112020100111 its reverse (111001020211), we get a palindrome (223021120322).
It can be divided in two parts, 112020100 and 111, that added together give a palindrome (112020211).
The spelling of 112020100111 in words is "one hundred twelve billion, twenty million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •