Base | Representation |
---|---|
bin | 100010100110101… |
… | …0001100100010011 |
3 | 2222220211101101001 |
4 | 1011031101210103 |
5 | 4334220421411 |
6 | 311114322431 |
7 | 40526152510 |
oct | 10515214423 |
9 | 2886741331 |
10 | 1161107731 |
11 | 546462473 |
12 | 284a29417 |
13 | 156727bc4 |
14 | b02c8307 |
15 | 6be06dc1 |
hex | 45351913 |
1161107731 has 4 divisors (see below), whose sum is σ = 1326980272. Its totient is φ = 995235192.
The previous prime is 1161107707. The next prime is 1161107737. The reversal of 1161107731 is 1377011611.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1161107731 - 29 = 1161107219 is a prime.
It is a super-2 number, since 2×11611077312 = 2696342325975936722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1161107731.
It is not an unprimeable number, because it can be changed into a prime (1161107737) 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 in 3 ways as a sum of consecutive naturals, for example, 82936260 + ... + 82936273.
It is an arithmetic number, because the mean of its divisors is an integer number (331745068).
Almost surely, 21161107731 is an apocalyptic number.
1161107731 is a deficient number, since it is larger than the sum of its proper divisors (165872541).
1161107731 is an equidigital number, since it uses as much as digits as its factorization.
1161107731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165872540.
The product of its (nonzero) digits is 882, while the sum is 28.
The square root of 1161107731 is about 34075.0309024071. The cubic root of 1161107731 is about 1051.0519256873.
The spelling of 1161107731 in words is "one billion, one hundred sixty-one million, one hundred seven thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •