Base | Representation |
---|---|
bin | 1101010010000… |
… | …10101010100010 |
3 | 21202122211101222 |
4 | 12221002222202 |
5 | 212011001424 |
6 | 15020055042 |
7 | 2522033546 |
oct | 651025242 |
9 | 252584358 |
10 | 111422114 |
11 | 579930a1 |
12 | 31394482 |
13 | 1a11275b |
14 | 10b25a26 |
15 | 9bade5e |
hex | 6a42aa2 |
111422114 has 8 divisors (see below), whose sum is σ = 176964588. Its totient is φ = 52433920.
The previous prime is 111422111. The next prime is 111422117. The reversal of 111422114 is 411224111.
It is an interprime number because it is at equal distance from previous prime (111422111) and next prime (111422117).
It can be written as a sum of positive squares in 2 ways, for example, as 110355025 + 1067089 = 10505^2 + 1033^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 111422092 and 111422101.
It is not an unprimeable number, because it can be changed into a prime (111422111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1638527 + ... + 1638594.
Almost surely, 2111422114 is an apocalyptic number.
111422114 is a deficient number, since it is larger than the sum of its proper divisors (65542474).
111422114 is a wasteful number, since it uses less digits than its factorization.
111422114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3277140.
The product of its digits is 64, while the sum is 17.
The square root of 111422114 is about 10555.6673877117. The cubic root of 111422114 is about 481.1979827063.
Adding to 111422114 its reverse (411224111), we get a palindrome (522646225).
The spelling of 111422114 in words is "one hundred eleven million, four hundred twenty-two thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •