Base | Representation |
---|---|
bin | 110011100110110001… |
… | …100001111110001001 |
3 | 12022000201020022021022 |
4 | 303212301201332021 |
5 | 1401440301221213 |
6 | 41242225322225 |
7 | 4001100500354 |
oct | 634661417611 |
9 | 168021208238 |
10 | 55411351433 |
11 | 21555299519 |
12 | a8a5196375 |
13 | 52c0bb5919 |
14 | 29792ad29b |
15 | 16949a3308 |
hex | ce6c61f89 |
55411351433 has 2 divisors, whose sum is σ = 55411351434. Its totient is φ = 55411351432.
The previous prime is 55411351361. The next prime is 55411351459. The reversal of 55411351433 is 33415311455.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34339054864 + 21072296569 = 185308^2 + 145163^2 .
It is a cyclic number.
It is not a de Polignac number, because 55411351433 - 212 = 55411347337 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 55411351393 and 55411351402.
It is not a weakly prime, because it can be changed into another prime (55411351133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27705675716 + 27705675717.
It is an arithmetic number, because the mean of its divisors is an integer number (27705675717).
Almost surely, 255411351433 is an apocalyptic number.
It is an amenable number.
55411351433 is a deficient number, since it is larger than the sum of its proper divisors (1).
55411351433 is an equidigital number, since it uses as much as digits as its factorization.
55411351433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54000, while the sum is 35.
Adding to 55411351433 its reverse (33415311455), we get a palindrome (88826662888).
The spelling of 55411351433 in words is "fifty-five billion, four hundred eleven million, three hundred fifty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •