Base | Representation |
---|---|
bin | 11111010101011011010… |
… | …011111000011000001101 |
3 | 21121212001220200220122102 |
4 | 133111123103320120031 |
5 | 240234440000203423 |
6 | 4325114530124445 |
7 | 311400020465102 |
oct | 37253323703015 |
9 | 7555056626572 |
10 | 2153310553613 |
11 | 76023974195a |
12 | 2a93ab420725 |
13 | 12809694c69b |
14 | 76313ba6aa9 |
15 | 3b02c546c28 |
hex | 1f55b4f860d |
2153310553613 has 2 divisors, whose sum is σ = 2153310553614. Its totient is φ = 2153310553612.
The previous prime is 2153310553547. The next prime is 2153310553621. The reversal of 2153310553613 is 3163550133512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1740821637604 + 412488916009 = 1319402^2 + 642253^2 .
It is a cyclic number.
It is not a de Polignac number, because 2153310553613 - 220 = 2153309505037 is a prime.
It is a super-2 number, since 2×21533105536132 (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 (2153310553643) 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, 1076655276806 + 1076655276807.
It is an arithmetic number, because the mean of its divisors is an integer number (1076655276807).
Almost surely, 22153310553613 is an apocalyptic number.
It is an amenable number.
2153310553613 is a deficient number, since it is larger than the sum of its proper divisors (1).
2153310553613 is an equidigital number, since it uses as much as digits as its factorization.
2153310553613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 121500, while the sum is 38.
The spelling of 2153310553613 in words is "two trillion, one hundred fifty-three billion, three hundred ten million, five hundred fifty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •