Base | Representation |
---|---|
bin | 110011111000010101… |
… | …1100001111001111111 |
3 | 101122120111120101010112 |
4 | 1213300223201321333 |
5 | 3311133001002221 |
6 | 123103152300235 |
7 | 11022616303604 |
oct | 1476053417177 |
9 | 348514511115 |
10 | 111412125311 |
11 | 43282270823 |
12 | 1971384167b |
13 | a676c32706 |
14 | 556c9706ab |
15 | 2d7108515b |
hex | 19f0ae1e7f |
111412125311 has 4 divisors (see below), whose sum is σ = 117275921400. Its totient is φ = 105548329224.
The previous prime is 111412125287. The next prime is 111412125317. The reversal of 111412125311 is 113521214111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113521214111 = 2411 ⋅47084701.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111412125311 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 (111412125317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2931898016 + ... + 2931898053.
It is an arithmetic number, because the mean of its divisors is an integer number (29318980350).
Almost surely, 2111412125311 is an apocalyptic number.
111412125311 is a deficient number, since it is larger than the sum of its proper divisors (5863796089).
111412125311 is an equidigital number, since it uses as much as digits as its factorization.
111412125311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5863796088.
The product of its digits is 240, while the sum is 23.
Adding to 111412125311 its reverse (113521214111), we get a palindrome (224933339422).
The spelling of 111412125311 in words is "one hundred eleven billion, four hundred twelve million, one hundred twenty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •