Base | Representation |
---|---|
bin | 10000110011101100111… |
… | …011011100101111111001 |
3 | 11002102022202122111221012 |
4 | 100303230323130233321 |
5 | 122410443204230203 |
6 | 2242340044523305 |
7 | 146306425033451 |
oct | 20635473345771 |
9 | 4072282574835 |
10 | 1155026242553 |
11 | 405931225507 |
12 | 167a27b50535 |
13 | 84bc2c64501 |
14 | 3dc9156ad61 |
15 | 200a1732bd8 |
hex | 10cecedcbf9 |
1155026242553 has 2 divisors, whose sum is σ = 1155026242554. Its totient is φ = 1155026242552.
The previous prime is 1155026242547. The next prime is 1155026242577. The reversal of 1155026242553 is 3552426205511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1120405314064 + 34620928489 = 1058492^2 + 186067^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1155026242553 is a prime.
It is a super-3 number, since 3×11550262425533 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1155026242553.
It is not a weakly prime, because it can be changed into another prime (1155026202553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 577513121276 + 577513121277.
It is an arithmetic number, because the mean of its divisors is an integer number (577513121277).
Almost surely, 21155026242553 is an apocalyptic number.
It is an amenable number.
1155026242553 is a deficient number, since it is larger than the sum of its proper divisors (1).
1155026242553 is an equidigital number, since it uses as much as digits as its factorization.
1155026242553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 1155026242553 in words is "one trillion, one hundred fifty-five billion, twenty-six million, two hundred forty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •