Base | Representation |
---|---|
bin | 100001101101101… |
… | …0000010100001101 |
3 | 2220211120211121222 |
4 | 1003123100110031 |
5 | 4304042440224 |
6 | 304125533125 |
7 | 40014124133 |
oct | 10333202415 |
9 | 2824524558 |
10 | 1131218189 |
11 | 5305a7a72 |
12 | 276a141a5 |
13 | 15049129a |
14 | aa347753 |
15 | 694a0b5e |
hex | 436d050d |
1131218189 has 2 divisors, whose sum is σ = 1131218190. Its totient is φ = 1131218188.
The previous prime is 1131218183. The next prime is 1131218191. The reversal of 1131218189 is 9818121311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1121245225 + 9972964 = 33485^2 + 3158^2 .
It is a cyclic number.
It is not a de Polignac number, because 1131218189 - 24 = 1131218173 is a prime.
It is a super-2 number, since 2×11312181892 = 2559309182248879442, which contains 22 as substring.
Together with 1131218191, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131218183) 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 as a sum of consecutive naturals, namely, 565609094 + 565609095.
It is an arithmetic number, because the mean of its divisors is an integer number (565609095).
Almost surely, 21131218189 is an apocalyptic number.
It is an amenable number.
1131218189 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131218189 is an equidigital number, since it uses as much as digits as its factorization.
1131218189 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 35.
The square root of 1131218189 is about 33633.5872157580. The cubic root of 1131218189 is about 1041.9545925127.
The spelling of 1131218189 in words is "one billion, one hundred thirty-one million, two hundred eighteen thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •