Base | Representation |
---|---|
bin | 100010100111000… |
… | …0010001110110001 |
3 | 2222221012111210111 |
4 | 1011032002032301 |
5 | 4334243311212 |
6 | 311122501321 |
7 | 40530642601 |
oct | 10516021661 |
9 | 2887174714 |
10 | 1161307057 |
11 | 5465891a9 |
12 | 284b04841 |
13 | 156797851 |
14 | b033ac01 |
15 | 6be45ea7 |
hex | 453823b1 |
1161307057 has 4 divisors (see below), whose sum is σ = 1163246400. Its totient is φ = 1159367716.
The previous prime is 1161307039. The next prime is 1161307061. The reversal of 1161307057 is 7507031611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1161307057 - 27 = 1161306929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1161307097) 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, 968773 + ... + 969970.
It is an arithmetic number, because the mean of its divisors is an integer number (290811600).
Almost surely, 21161307057 is an apocalyptic number.
It is an amenable number.
1161307057 is a deficient number, since it is larger than the sum of its proper divisors (1939343).
1161307057 is an equidigital number, since it uses as much as digits as its factorization.
1161307057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1939342.
The product of its (nonzero) digits is 4410, while the sum is 31.
The square root of 1161307057 is about 34077.9555871534. The cubic root of 1161307057 is about 1051.1120665291.
Adding to 1161307057 its reverse (7507031611), we get a palindrome (8668338668).
The spelling of 1161307057 in words is "one billion, one hundred sixty-one million, three hundred seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •