Base | Representation |
---|---|
bin | 10101110001000100… |
… | …10111111010001001 |
3 | 1010011102011221002001 |
4 | 22320202113322021 |
5 | 142413101000121 |
6 | 5211330311001 |
7 | 562405651201 |
oct | 127042277211 |
9 | 33142157061 |
10 | 11685953161 |
11 | 4a57463633 |
12 | 2321728461 |
13 | 11430891ac |
14 | 7cc02d401 |
15 | 485dd9991 |
hex | 2b8897e89 |
11685953161 has 6 divisors (see below), whose sum is σ = 12075080586. Its totient is φ = 11308986000.
The previous prime is 11685953143. The next prime is 11685953197. The reversal of 11685953161 is 16135958611.
It is a happy number.
11685953161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10313621136 + 1372332025 = 101556^2 + 37045^2 .
It is not a de Polignac number, because 11685953161 - 223 = 11677564553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11685953761) 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 in 5 ways as a sum of consecutive naturals, for example, 6079140 + ... + 6081061.
It is an arithmetic number, because the mean of its divisors is an integer number (2012513431).
Almost surely, 211685953161 is an apocalyptic number.
It is an amenable number.
11685953161 is a deficient number, since it is larger than the sum of its proper divisors (389127425).
11685953161 is an equidigital number, since it uses as much as digits as its factorization.
11685953161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12160263 (or 12160232 counting only the distinct ones).
The product of its digits is 194400, while the sum is 46.
The spelling of 11685953161 in words is "eleven billion, six hundred eighty-five million, nine hundred fifty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •