Base | Representation |
---|---|
bin | 1010110010000111101110… |
… | …1000001100000010101001 |
3 | 1112222102212211122201021122 |
4 | 2230201323220030002221 |
5 | 3023222431032311414 |
6 | 41114353343145025 |
7 | 2332403201042432 |
oct | 254417350140251 |
9 | 45872784581248 |
10 | 11856183869609 |
11 | 38611a77824a2 |
12 | 13b5983ba5175 |
13 | 680058336491 |
14 | 2cdbb1620489 |
15 | 158617198b8e |
hex | ac87ba0c0a9 |
11856183869609 has 2 divisors, whose sum is σ = 11856183869610. Its totient is φ = 11856183869608.
The previous prime is 11856183869557. The next prime is 11856183869617. The reversal of 11856183869609 is 90696838165811.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11849622059584 + 6561810025 = 3442328^2 + 81005^2 .
It is a cyclic number.
It is not a de Polignac number, because 11856183869609 - 28 = 11856183869353 is a prime.
It is a super-2 number, since 2×118561838696092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11856183865609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5928091934804 + 5928091934805.
It is an arithmetic number, because the mean of its divisors is an integer number (5928091934805).
Almost surely, 211856183869609 is an apocalyptic number.
It is an amenable number.
11856183869609 is a deficient number, since it is larger than the sum of its proper divisors (1).
11856183869609 is an equidigital number, since it uses as much as digits as its factorization.
11856183869609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 134369280, while the sum is 71.
The spelling of 11856183869609 in words is "eleven trillion, eight hundred fifty-six billion, one hundred eighty-three million, eight hundred sixty-nine thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •