Base | Representation |
---|---|
bin | 10001000100000001… |
… | …10000001000101001 |
3 | 212122102012111221111 |
4 | 20202000300020221 |
5 | 122230100311342 |
6 | 4112554310321 |
7 | 443002310356 |
oct | 104200601051 |
9 | 25572174844 |
10 | 9160557097 |
11 | 398099414a |
12 | 1937a283a1 |
13 | b2cb074b3 |
14 | 62c88b62d |
15 | 389344217 |
hex | 222030229 |
9160557097 has 2 divisors, whose sum is σ = 9160557098. Its totient is φ = 9160557096.
The previous prime is 9160557089. The next prime is 9160557169. The reversal of 9160557097 is 7907550619.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8363285401 + 797271696 = 91451^2 + 28236^2 .
It is a cyclic number.
It is not a de Polignac number, because 9160557097 - 23 = 9160557089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9160557097.
It is not a weakly prime, because it can be changed into another prime (9160557037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4580278548 + 4580278549.
It is an arithmetic number, because the mean of its divisors is an integer number (4580278549).
Almost surely, 29160557097 is an apocalyptic number.
It is an amenable number.
9160557097 is a deficient number, since it is larger than the sum of its proper divisors (1).
9160557097 is an equidigital number, since it uses as much as digits as its factorization.
9160557097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 595350, while the sum is 49.
The square root of 9160557097 is about 95710.7992705107. The cubic root of 9160557097 is about 2092.3803299586.
The spelling of 9160557097 in words is "nine billion, one hundred sixty million, five hundred fifty-seven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •