Base | Representation |
---|---|
bin | 10001101010101110… |
… | …01110100110100001 |
3 | 220111001002220110021 |
4 | 20311113032212201 |
5 | 123411203404121 |
6 | 4205113033441 |
7 | 454024002301 |
oct | 106527164641 |
9 | 26431086407 |
10 | 9485216161 |
11 | 4028180323 |
12 | 1a086b5881 |
13 | b8215a255 |
14 | 65da3d601 |
15 | 3a7ac4641 |
hex | 2355ce9a1 |
9485216161 has 2 divisors, whose sum is σ = 9485216162. Its totient is φ = 9485216160.
The previous prime is 9485216159. The next prime is 9485216173. The reversal of 9485216161 is 1616125849.
9485216161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8401555600 + 1083660561 = 91660^2 + 32919^2 .
It is a cyclic number.
It is not a de Polignac number, because 9485216161 - 21 = 9485216159 is a prime.
Together with 9485216159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (9485226161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4742608080 + 4742608081.
It is an arithmetic number, because the mean of its divisors is an integer number (4742608081).
Almost surely, 29485216161 is an apocalyptic number.
It is an amenable number.
9485216161 is a deficient number, since it is larger than the sum of its proper divisors (1).
9485216161 is an equidigital number, since it uses as much as digits as its factorization.
9485216161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 43.
The square root of 9485216161 is about 97392.0744260024. The cubic root of 9485216161 is about 2116.8125948316.
The spelling of 9485216161 in words is "nine billion, four hundred eighty-five million, two hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •