Base | Representation |
---|---|
bin | 100010010111011… |
… | …1000010110100011 |
3 | 2222100211120212202 |
4 | 1010232320112203 |
5 | 4330200441011 |
6 | 310231443415 |
7 | 40401346403 |
oct | 10456702643 |
9 | 2870746782 |
10 | 1153140131 |
11 | 541a10280 |
12 | 28222656b |
13 | 154b98450 |
14 | ad212803 |
15 | 6b38123b |
hex | 44bb85a3 |
1153140131 has 8 divisors (see below), whose sum is σ = 1354738224. Its totient is φ = 967669920.
The previous prime is 1153140127. The next prime is 1153140143. The reversal of 1153140131 is 1310413511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1153140131 - 22 = 1153140127 is a prime.
It is a super-2 number, since 2×11531401312 = 2659464323445394322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1153140101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4031816 + ... + 4032101.
It is an arithmetic number, because the mean of its divisors is an integer number (169342278).
Almost surely, 21153140131 is an apocalyptic number.
1153140131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1153140131 is a deficient number, since it is larger than the sum of its proper divisors (201598093).
1153140131 is a wasteful number, since it uses less digits than its factorization.
1153140131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8063941.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 1153140131 is about 33957.9170592073. The cubic root of 1153140131 is about 1048.6422756597.
Adding to 1153140131 its reverse (1310413511), we get a palindrome (2463553642).
The spelling of 1153140131 in words is "one billion, one hundred fifty-three million, one hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •