Base | Representation |
---|---|
bin | 100010011111011… |
… | …1010011110011011 |
3 | 2222122202010022102 |
4 | 1010332322132123 |
5 | 4332234440011 |
6 | 310501514015 |
7 | 40452153140 |
oct | 10476723633 |
9 | 2878663272 |
10 | 1157343131 |
11 | 54432102a |
12 | 28371290b |
13 | 155a0a529 |
14 | ad9c83c7 |
15 | 6b91173b |
hex | 44fba79b |
1157343131 has 4 divisors (see below), whose sum is σ = 1322677872. Its totient is φ = 992008392.
The previous prime is 1157343113. The next prime is 1157343133. The reversal of 1157343131 is 1313437511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1157343131 - 214 = 1157326747 is a prime.
It is a super-2 number, since 2×11573431312 = 2678886245745766322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1157343094 and 1157343103.
It is not an unprimeable number, because it can be changed into a prime (1157343133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 82667360 + ... + 82667373.
It is an arithmetic number, because the mean of its divisors is an integer number (330669468).
Almost surely, 21157343131 is an apocalyptic number.
1157343131 is a deficient number, since it is larger than the sum of its proper divisors (165334741).
1157343131 is an equidigital number, since it uses as much as digits as its factorization.
1157343131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165334740.
The product of its digits is 3780, while the sum is 29.
The square root of 1157343131 is about 34019.7461924689. The cubic root of 1157343131 is about 1049.9147719182.
The spelling of 1157343131 in words is "one billion, one hundred fifty-seven million, three hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •