Base | Representation |
---|---|
bin | 10000000111000011101… |
… | …00011001101100110001 |
3 | 1221220210110111021212021 |
4 | 20003201310121230301 |
5 | 33032124333033431 |
6 | 1102143402031441 |
7 | 54664226654434 |
oct | 10034164315461 |
9 | 1856713437767 |
10 | 553544424241 |
11 | 1a383643a986 |
12 | 8b344aa8581 |
13 | 4027830c643 |
14 | 1cb1259781b |
15 | e5eb75cb11 |
hex | 80e1d19b31 |
553544424241 has 2 divisors, whose sum is σ = 553544424242. Its totient is φ = 553544424240.
The previous prime is 553544424221. The next prime is 553544424289. The reversal of 553544424241 is 142424445355.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 465572864241 + 87971560000 = 682329^2 + 296600^2 .
It is a cyclic number.
It is not a de Polignac number, because 553544424241 - 225 = 553510869809 is a prime.
It is a super-2 number, since 2×5535444242412 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (553544424221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276772212120 + 276772212121.
It is an arithmetic number, because the mean of its divisors is an integer number (276772212121).
Almost surely, 2553544424241 is an apocalyptic number.
It is an amenable number.
553544424241 is a deficient number, since it is larger than the sum of its proper divisors (1).
553544424241 is an equidigital number, since it uses as much as digits as its factorization.
553544424241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536000, while the sum is 43.
Adding to 553544424241 its reverse (142424445355), we get a palindrome (695968869596).
The spelling of 553544424241 in words is "five hundred fifty-three billion, five hundred forty-four million, four hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •