Base | Representation |
---|---|
bin | 1010011110110111111101… |
… | …0111100010001001111001 |
3 | 1111210211102021211122002102 |
4 | 2213231333113202021321 |
5 | 3002313243214141214 |
6 | 40302431323513145 |
7 | 2266456323453026 |
oct | 247557727421171 |
9 | 44724367748072 |
10 | 11525534130809 |
11 | 3743a51601856 |
12 | 13618860887b5 |
13 | 657b1265066a |
14 | 2bbba5a6054d |
15 | 14ec13d1abde |
hex | a7b7f5e2279 |
11525534130809 has 2 divisors, whose sum is σ = 11525534130810. Its totient is φ = 11525534130808.
The previous prime is 11525534130787. The next prime is 11525534130811. The reversal of 11525534130809 is 90803143552511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7827712818025 + 3697821312784 = 2797805^2 + 1922972^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11525534130809 is a prime.
It is a super-2 number, since 2×115255341308092 (a number of 27 digits) contains 22 as substring.
Together with 11525534130811, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11525534130839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5762767065404 + 5762767065405.
It is an arithmetic number, because the mean of its divisors is an integer number (5762767065405).
Almost surely, 211525534130809 is an apocalyptic number.
It is an amenable number.
11525534130809 is a deficient number, since it is larger than the sum of its proper divisors (1).
11525534130809 is an equidigital number, since it uses as much as digits as its factorization.
11525534130809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648000, while the sum is 47.
The spelling of 11525534130809 in words is "eleven trillion, five hundred twenty-five billion, five hundred thirty-four million, one hundred thirty thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •