Base | Representation |
---|---|
bin | 110100001100111010… |
… | …0010101100111001111 |
3 | 101201100121020212222011 |
4 | 1220121310111213033 |
5 | 3314041142100421 |
6 | 123255445202051 |
7 | 11045666554204 |
oct | 1503164254717 |
9 | 351317225864 |
10 | 112102300111 |
11 | 435a690a31a |
12 | 19886a00327 |
13 | a756c11979 |
14 | 55d64abcab |
15 | 2db19664e1 |
hex | 1a19d159cf |
112102300111 has 4 divisors (see below), whose sum is σ = 112361197312. Its totient is φ = 111843402912.
The previous prime is 112102300097. The next prime is 112102300139. The reversal of 112102300111 is 111003201211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112102300111 - 219 = 112101775823 is a prime.
It is a super-2 number, since 2×1121023001112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112102300091 and 112102300100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112102301111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129447951 + ... + 129448816.
It is an arithmetic number, because the mean of its divisors is an integer number (28090299328).
Almost surely, 2112102300111 is an apocalyptic number.
112102300111 is a deficient number, since it is larger than the sum of its proper divisors (258897201).
112102300111 is an equidigital number, since it uses as much as digits as its factorization.
112102300111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 258897200.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 112102300111 its reverse (111003201211), we get a palindrome (223105501322).
The spelling of 112102300111 in words is "one hundred twelve billion, one hundred two million, three hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •