Base | Representation |
---|---|
bin | 1010100000011010100011… |
… | …1000110111000101010111 |
3 | 1111220100201210001100220202 |
4 | 2220012220320313011113 |
5 | 3003231444114140134 |
6 | 40322525450451115 |
7 | 2301414225264623 |
oct | 250065070670527 |
9 | 44810653040822 |
10 | 11552000536919 |
11 | 37541a3163457 |
12 | 1366a31733a9b |
13 | 65a46c9163ab |
14 | 2bd196a84183 |
15 | 1507625edd7e |
hex | a81a8e37157 |
11552000536919 has 2 divisors, whose sum is σ = 11552000536920. Its totient is φ = 11552000536918.
The previous prime is 11552000536903. The next prime is 11552000536927. The reversal of 11552000536919 is 91963500025511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11552000536919 - 24 = 11552000536903 is a prime.
It is a super-2 number, since 2×115520005369192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11552000536939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5776000268459 + 5776000268460.
It is an arithmetic number, because the mean of its divisors is an integer number (5776000268460).
Almost surely, 211552000536919 is an apocalyptic number.
11552000536919 is a deficient number, since it is larger than the sum of its proper divisors (1).
11552000536919 is an equidigital number, since it uses as much as digits as its factorization.
11552000536919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 364500, while the sum is 47.
The spelling of 11552000536919 in words is "eleven trillion, five hundred fifty-two billion, five hundred thirty-six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •