Base | Representation |
---|---|
bin | 100010100110100… |
… | …1000001001010001 |
3 | 2222220202102102122 |
4 | 1011031020021101 |
5 | 4334213203022 |
6 | 311113424025 |
7 | 40525632134 |
oct | 10515101121 |
9 | 2886672378 |
10 | 1161069137 |
11 | 546436478 |
12 | 284a0b015 |
13 | 156713477 |
14 | b02b821b |
15 | 6bdea742 |
hex | 45348251 |
1161069137 has 2 divisors, whose sum is σ = 1161069138. Its totient is φ = 1161069136.
The previous prime is 1161069121. The next prime is 1161069167. The reversal of 1161069137 is 7319601611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 616826896 + 544242241 = 24836^2 + 23329^2 .
It is a cyclic number.
It is not a de Polignac number, because 1161069137 - 24 = 1161069121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1161069097 and 1161069106.
It is not a weakly prime, because it can be changed into another prime (1161069167) 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 as a sum of consecutive naturals, namely, 580534568 + 580534569.
It is an arithmetic number, because the mean of its divisors is an integer number (580534569).
Almost surely, 21161069137 is an apocalyptic number.
It is an amenable number.
1161069137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1161069137 is an equidigital number, since it uses as much as digits as its factorization.
1161069137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 35.
The square root of 1161069137 is about 34074.4645886036. The cubic root of 1161069137 is about 1051.0402802714.
The spelling of 1161069137 in words is "one billion, one hundred sixty-one million, sixty-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •