Base | Representation |
---|---|
bin | 110100001101001111… |
… | …0010011111001000110 |
3 | 101201101100221220020122 |
4 | 1220122132103321012 |
5 | 3314102001144420 |
6 | 123300521101542 |
7 | 11046162232004 |
oct | 1503236237106 |
9 | 351340856218 |
10 | 112113303110 |
11 | 43602045006 |
12 | 1988a6278b2 |
13 | a759294c13 |
14 | 55d7b33a74 |
15 | 2db28db725 |
hex | 1a1a793e46 |
112113303110 has 8 divisors (see below), whose sum is σ = 201803945616. Its totient is φ = 44845321240.
The previous prime is 112113303103. The next prime is 112113303119. The reversal of 112113303110 is 11303311211.
112113303110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112113303119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5605665146 + ... + 5605665165.
It is an arithmetic number, because the mean of its divisors is an integer number (25225493202).
Almost surely, 2112113303110 is an apocalyptic number.
112113303110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112113303110 is a deficient number, since it is larger than the sum of its proper divisors (89690642506).
112113303110 is a wasteful number, since it uses less digits than its factorization.
112113303110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11211330318.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 112113303110 its reverse (11303311211), we get a palindrome (123416614321).
The spelling of 112113303110 in words is "one hundred twelve billion, one hundred thirteen million, three hundred three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •