Base | Representation |
---|---|
bin | 101000011001111000010… |
… | …1001101111100011110101 |
3 | 201122212121112121201221011 |
4 | 1100303300221233203311 |
5 | 1211440310104032411 |
6 | 15451024115552221 |
7 | 1112125603364305 |
oct | 120636051574365 |
9 | 21585545551834 |
10 | 5553135220981 |
11 | 1851087075a27 |
12 | 7582998bb671 |
13 | 31387368c2aa |
14 | 152ab7861605 |
15 | 996b309dc21 |
hex | 50cf0a6f8f5 |
5553135220981 has 2 divisors, whose sum is σ = 5553135220982. Its totient is φ = 5553135220980.
The previous prime is 5553135220973. The next prime is 5553135221027. The reversal of 5553135220981 is 1890225313555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4748106370225 + 805028850756 = 2179015^2 + 897234^2 .
It is a cyclic number.
It is not a de Polignac number, because 5553135220981 - 23 = 5553135220973 is a prime.
It is a super-2 number, since 2×55531352209812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5553135220921) 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, 2776567610490 + 2776567610491.
It is an arithmetic number, because the mean of its divisors is an integer number (2776567610491).
Almost surely, 25553135220981 is an apocalyptic number.
It is an amenable number.
5553135220981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5553135220981 is an equidigital number, since it uses as much as digits as its factorization.
5553135220981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620000, while the sum is 49.
The spelling of 5553135220981 in words is "five trillion, five hundred fifty-three billion, one hundred thirty-five million, two hundred twenty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •