Base | Representation |
---|---|
bin | 1010011110110111100011… |
… | …0000011100100001001001 |
3 | 1111210211010120010211011122 |
4 | 2213231320300130201021 |
5 | 3002313031321031214 |
6 | 40302412322405025 |
7 | 2266453505651201 |
oct | 247557060344111 |
9 | 44724116124148 |
10 | 11525423220809 |
11 | 37439a4a394a3 |
12 | 1361854b00775 |
13 | 657ac568a044 |
14 | 2bbb9502d401 |
15 | 14ec0920d88e |
hex | a7b78c1c849 |
11525423220809 has 2 divisors, whose sum is σ = 11525423220810. Its totient is φ = 11525423220808.
The previous prime is 11525423220799. The next prime is 11525423220851. The reversal of 11525423220809 is 90802232452511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6772761617209 + 4752661603600 = 2602453^2 + 2180060^2 .
It is a cyclic number.
It is not a de Polignac number, because 11525423220809 - 216 = 11525423155273 is a prime.
It is a super-2 number, since 2×115254232208092 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11525423220809.
It is not a weakly prime, because it can be changed into another prime (11525423220859) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5762711610404 + 5762711610405.
It is an arithmetic number, because the mean of its divisors is an integer number (5762711610405).
Almost surely, 211525423220809 is an apocalyptic number.
It is an amenable number.
11525423220809 is a deficient number, since it is larger than the sum of its proper divisors (1).
11525423220809 is an equidigital number, since it uses as much as digits as its factorization.
11525423220809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 345600, while the sum is 44.
The spelling of 11525423220809 in words is "eleven trillion, five hundred twenty-five billion, four hundred twenty-three million, two hundred twenty thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •