Base | Representation |
---|---|
bin | 1100010100111111010010… |
… | …0010101010001111110001 |
3 | 1202222211010001121012012022 |
4 | 3011033310202222033301 |
5 | 3234040033440424041 |
6 | 44454542100441225 |
7 | 2566203465422015 |
oct | 305176442521761 |
9 | 52884101535168 |
10 | 13554724545521 |
11 | 43565876a9215 |
12 | 162abb59a9215 |
13 | 77428861c073 |
14 | 34c0a3216545 |
15 | 1878c980524b |
hex | c53f48aa3f1 |
13554724545521 has 2 divisors, whose sum is σ = 13554724545522. Its totient is φ = 13554724545520.
The previous prime is 13554724545499. The next prime is 13554724545529. The reversal of 13554724545521 is 12554542745531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13511218929121 + 43505616400 = 3675761^2 + 208580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13554724545521 is a prime.
It is a super-2 number, since 2×135547245455212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13554724545529) 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, 6777362272760 + 6777362272761.
It is an arithmetic number, because the mean of its divisors is an integer number (6777362272761).
Almost surely, 213554724545521 is an apocalyptic number.
It is an amenable number.
13554724545521 is a deficient number, since it is larger than the sum of its proper divisors (1).
13554724545521 is an equidigital number, since it uses as much as digits as its factorization.
13554724545521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16800000, while the sum is 53.
The spelling of 13554724545521 in words is "thirteen trillion, five hundred fifty-four billion, seven hundred twenty-four million, five hundred forty-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •