Base | Representation |
---|---|
bin | 1101010110011… |
… | …01000110010001 |
3 | 21210201122012211 |
4 | 12223031012101 |
5 | 212132123022 |
6 | 15040152121 |
7 | 2526614641 |
oct | 653150621 |
9 | 253648184 |
10 | 111989137 |
11 | 58240107 |
12 | 31608641 |
13 | 1a280880 |
14 | 10c32521 |
15 | 9c71e77 |
hex | 6acd191 |
111989137 has 4 divisors (see below), whose sum is σ = 120603700. Its totient is φ = 103374576.
The previous prime is 111989123. The next prime is 111989167. The reversal of 111989137 is 731989111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 76895361 + 35093776 = 8769^2 + 5924^2 .
It is a cyclic number.
It is not a de Polignac number, because 111989137 - 211 = 111987089 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 111989137.
It is not an unprimeable number, because it can be changed into a prime (111989117) 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 3 ways as a sum of consecutive naturals, for example, 4307262 + ... + 4307287.
It is an arithmetic number, because the mean of its divisors is an integer number (30150925).
Almost surely, 2111989137 is an apocalyptic number.
It is an amenable number.
111989137 is a deficient number, since it is larger than the sum of its proper divisors (8614563).
111989137 is an equidigital number, since it uses as much as digits as its factorization.
111989137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8614562.
The product of its digits is 13608, while the sum is 40.
The square root of 111989137 is about 10582.4920033043. The cubic root of 111989137 is about 482.0128681791.
The spelling of 111989137 in words is "one hundred eleven million, nine hundred eighty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •