Base | Representation |
---|---|
bin | 11110101010100001110… |
… | …01000110111101101101 |
3 | 10201201120212200202102212 |
4 | 33111100321012331231 |
5 | 114230310234314113 |
6 | 2124010033500205 |
7 | 136056534245414 |
oct | 17252071067555 |
9 | 3651525622385 |
10 | 1053624135533 |
11 | 3769263a1682 |
12 | 150248711665 |
13 | 78482b19258 |
14 | 38dd220a47b |
15 | 1c6193890a8 |
hex | f550e46f6d |
1053624135533 has 2 divisors, whose sum is σ = 1053624135534. Its totient is φ = 1053624135532.
The previous prime is 1053624135523. The next prime is 1053624135607. The reversal of 1053624135533 is 3355314263501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1047095818729 + 6528316804 = 1023277^2 + 80798^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053624135533 - 216 = 1053624069997 is a prime.
It is a super-2 number, since 2×10536241355332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053624135523) 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, 526812067766 + 526812067767.
It is an arithmetic number, because the mean of its divisors is an integer number (526812067767).
Almost surely, 21053624135533 is an apocalyptic number.
It is an amenable number.
1053624135533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053624135533 is an equidigital number, since it uses as much as digits as its factorization.
1053624135533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 41.
The spelling of 1053624135533 in words is "one trillion, fifty-three billion, six hundred twenty-four million, one hundred thirty-five thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •