Base | Representation |
---|---|
bin | 100010011001010… |
… | …0000000010101011 |
3 | 2222102121210122220 |
4 | 1010302200002223 |
5 | 4330421323011 |
6 | 310304045123 |
7 | 40412411226 |
oct | 10462400253 |
9 | 2872553586 |
10 | 1154089131 |
11 | 5424a9278 |
12 | 2826037a3 |
13 | 15513b3a0 |
14 | ad3bc5bd |
15 | 6b4bc506 |
hex | 44ca00ab |
1154089131 has 16 divisors (see below), whose sum is σ = 1661022720. Its totient is φ = 708550560.
The previous prime is 1154089109. The next prime is 1154089141. The reversal of 1154089131 is 1319804511.
It is not a de Polignac number, because 1154089131 - 210 = 1154088107 is a prime.
It is a super-2 number, since 2×11540891312 = 2663843444584670322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1154089092 and 1154089101.
It is not an unprimeable number, because it can be changed into a prime (1154089141) 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 15 ways as a sum of consecutive naturals, for example, 17521 + ... + 51138.
It is an arithmetic number, because the mean of its divisors is an integer number (103813920).
Almost surely, 21154089131 is an apocalyptic number.
1154089131 is a deficient number, since it is larger than the sum of its proper divisors (506933589).
1154089131 is a wasteful number, since it uses less digits than its factorization.
1154089131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69106.
The product of its (nonzero) digits is 4320, while the sum is 33.
The square root of 1154089131 is about 33971.8873629358. The cubic root of 1154089131 is about 1048.9298639072.
The spelling of 1154089131 in words is "one billion, one hundred fifty-four million, eighty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •