Base | Representation |
---|---|
bin | 10000110011111001111… |
… | …111101010010100001101 |
3 | 11002102220001010102201101 |
4 | 100303321333222110031 |
5 | 122411420313404014 |
6 | 2242413515143101 |
7 | 146315026210633 |
oct | 20637177522415 |
9 | 4072801112641 |
10 | 1155245450509 |
11 | 405a33a37707 |
12 | 167a89444a91 |
13 | 84c294b5567 |
14 | 3dcb270d353 |
15 | 200b5ad3474 |
hex | 10cf9fea50d |
1155245450509 has 2 divisors, whose sum is σ = 1155245450510. Its totient is φ = 1155245450508.
The previous prime is 1155245450497. The next prime is 1155245450521. The reversal of 1155245450509 is 9050545425511.
It is a balanced prime because it is at equal distance from previous prime (1155245450497) and next prime (1155245450521).
It can be written as a sum of positive squares in only one way, i.e., 663174066025 + 492071384484 = 814355^2 + 701478^2 .
It is a cyclic number.
It is not a de Polignac number, because 1155245450509 - 25 = 1155245450477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1155245454509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 577622725254 + 577622725255.
It is an arithmetic number, because the mean of its divisors is an integer number (577622725255).
Almost surely, 21155245450509 is an apocalyptic number.
It is an amenable number.
1155245450509 is a deficient number, since it is larger than the sum of its proper divisors (1).
1155245450509 is an equidigital number, since it uses as much as digits as its factorization.
1155245450509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900000, while the sum is 46.
The spelling of 1155245450509 in words is "one trillion, one hundred fifty-five billion, two hundred forty-five million, four hundred fifty thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •