Base | Representation |
---|---|
bin | 110011101111111110… |
… | …1011110000100000001 |
3 | 101121211221201222222212 |
4 | 1213133331132010001 |
5 | 3310044143143424 |
6 | 123015252111505 |
7 | 11012642100656 |
oct | 1473775360401 |
9 | 347757658885 |
10 | 111131615489 |
11 | 43148999624 |
12 | 19655905595 |
13 | a630a99c7b |
14 | 55435d1c2d |
15 | 2d5662610e |
hex | 19dff5e101 |
111131615489 has 2 divisors, whose sum is σ = 111131615490. Its totient is φ = 111131615488.
The previous prime is 111131615453. The next prime is 111131615629. The reversal of 111131615489 is 984516131111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110285096464 + 846519025 = 332092^2 + 29095^2 .
It is an emirp because it is prime and its reverse (984516131111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111131615489 - 224 = 111114838273 is a prime.
It is a super-2 number, since 2×1111316154892 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111131615689) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55565807744 + 55565807745.
It is an arithmetic number, because the mean of its divisors is an integer number (55565807745).
Almost surely, 2111131615489 is an apocalyptic number.
It is an amenable number.
111131615489 is a deficient number, since it is larger than the sum of its proper divisors (1).
111131615489 is an equidigital number, since it uses as much as digits as its factorization.
111131615489 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25920, while the sum is 41.
The spelling of 111131615489 in words is "one hundred eleven billion, one hundred thirty-one million, six hundred fifteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •