Base | Representation |
---|---|
bin | 1101010010000… |
… | …10101000011111 |
3 | 21202122211020010 |
4 | 12221002220133 |
5 | 212011000413 |
6 | 15020054303 |
7 | 2522033301 |
oct | 651025037 |
9 | 252584203 |
10 | 111421983 |
11 | 57992a92 |
12 | 31394393 |
13 | 1a11268a |
14 | 10b25971 |
15 | 9baddc3 |
hex | 6a42a1f |
111421983 has 8 divisors (see below), whose sum is σ = 149632000. Its totient is φ = 73746648.
The previous prime is 111421957. The next prime is 111422009. The reversal of 111421983 is 389124111.
It is an interprime number because it is at equal distance from previous prime (111421957) and next prime (111422009).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111421983 - 216 = 111356447 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 111421983.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111421903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 133183 + ... + 134016.
It is an arithmetic number, because the mean of its divisors is an integer number (18704000).
Almost surely, 2111421983 is an apocalyptic number.
111421983 is a deficient number, since it is larger than the sum of its proper divisors (38210017).
111421983 is a wasteful number, since it uses less digits than its factorization.
111421983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267341.
The product of its digits is 1728, while the sum is 30.
The square root of 111421983 is about 10555.6611825124. The cubic root of 111421983 is about 481.1977941233.
The spelling of 111421983 in words is "one hundred eleven million, four hundred twenty-one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •