Base | Representation |
---|---|
bin | 110100010010110011… |
… | …0111001011010001111 |
3 | 101201212101110022221121 |
4 | 1220211212321122033 |
5 | 3314442311301221 |
6 | 123331232541411 |
7 | 11053621062004 |
oct | 1504546713217 |
9 | 351771408847 |
10 | 112300103311 |
11 | 43698531840 |
12 | 199210b1867 |
13 | a788baa096 |
14 | 561487b8ab |
15 | 2dc3ed9a41 |
hex | 1a259b968f |
112300103311 has 8 divisors (see below), whose sum is σ = 123722167248. Its totient is φ = 101080200000.
The previous prime is 112300103297. The next prime is 112300103369. The reversal of 112300103311 is 113301003211.
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 112300103311 - 29 = 112300102799 is a prime.
It is a super-2 number, since 2×1123001033112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112300133311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50538990 + ... + 50541211.
It is an arithmetic number, because the mean of its divisors is an integer number (15465270906).
Almost surely, 2112300103311 is an apocalyptic number.
112300103311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112300103311 is a deficient number, since it is larger than the sum of its proper divisors (11422063937).
112300103311 is a wasteful number, since it uses less digits than its factorization.
112300103311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101080313.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 112300103311 its reverse (113301003211), we get a palindrome (225601106522).
The spelling of 112300103311 in words is "one hundred twelve billion, three hundred million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •