Base | Representation |
---|---|
bin | 1010100000011110100001… |
… | …0101100101001100110001 |
3 | 1111220110110222002020112001 |
4 | 2220013220111211030301 |
5 | 3003241134121433244 |
6 | 40323223234334001 |
7 | 2301452502316405 |
oct | 250075025451461 |
9 | 44813428066461 |
10 | 11553065030449 |
11 | 375469a027178 |
12 | 136708a12a301 |
13 | 65a5ac314917 |
14 | 2bd2581bd105 |
15 | 1507c5cbe5d4 |
hex | a81e8565331 |
11553065030449 has 2 divisors, whose sum is σ = 11553065030450. Its totient is φ = 11553065030448.
The previous prime is 11553065030413. The next prime is 11553065030483. The reversal of 11553065030449 is 94403056035511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7984196199424 + 3568868831025 = 2825632^2 + 1889145^2 .
It is a cyclic number.
It is not a de Polignac number, because 11553065030449 - 217 = 11553064899377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11553065030399 and 11553065030408.
It is not a weakly prime, because it can be changed into another prime (11553065930449) 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, 5776532515224 + 5776532515225.
It is an arithmetic number, because the mean of its divisors is an integer number (5776532515225).
Almost surely, 211553065030449 is an apocalyptic number.
It is an amenable number.
11553065030449 is a deficient number, since it is larger than the sum of its proper divisors (1).
11553065030449 is an equidigital number, since it uses as much as digits as its factorization.
11553065030449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 46.
The spelling of 11553065030449 in words is "eleven trillion, five hundred fifty-three billion, sixty-five million, thirty thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •