Base | Representation |
---|---|
bin | 10000110000000011000… |
… | …101100011110110101001 |
3 | 11002001012100102101120211 |
4 | 100300003011203312221 |
5 | 122324424333241203 |
6 | 2240450500421121 |
7 | 146110256161216 |
oct | 20600305436651 |
9 | 4061170371524 |
10 | 1151103024553 |
11 | 4041a8714789 |
12 | 1671120a77a1 |
13 | 84719217541 |
14 | 3d9dc4c2b0d |
15 | 1ee220c7c6d |
hex | 10c03163da9 |
1151103024553 has 2 divisors, whose sum is σ = 1151103024554. Its totient is φ = 1151103024552.
The previous prime is 1151103024521. The next prime is 1151103024581. The reversal of 1151103024553 is 3554203011511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1097941421929 + 53161602624 = 1047827^2 + 230568^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151103024553 - 25 = 1151103024521 is a prime.
It is not a weakly prime, because it can be changed into another prime (1151103124553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575551512276 + 575551512277.
It is an arithmetic number, because the mean of its divisors is an integer number (575551512277).
Almost surely, 21151103024553 is an apocalyptic number.
It is an amenable number.
1151103024553 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151103024553 is an equidigital number, since it uses as much as digits as its factorization.
1151103024553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 1151103024553 in words is "one trillion, one hundred fifty-one billion, one hundred three million, twenty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •