Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …00010101110101001001 |
3 | 1222011021010010101102101 |
4 | 20011313030111311021 |
5 | 33102242412130113 |
6 | 1103240204033401 |
7 | 55113310210432 |
oct | 10056714256511 |
9 | 1864233111371 |
10 | 556050505033 |
11 | 1a4902017531 |
12 | 8b924232861 |
13 | 4058758a79a |
14 | 1ccad34c489 |
15 | e6e678a2dd |
hex | 8177315d49 |
556050505033 has 2 divisors, whose sum is σ = 556050505034. Its totient is φ = 556050505032.
The previous prime is 556050504943. The next prime is 556050505069. The reversal of 556050505033 is 330505050655.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 403881857289 + 152168647744 = 635517^2 + 390088^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-556050505033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 556050504983 and 556050505001.
It is not a weakly prime, because it can be changed into another prime (556050505093) 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, 278025252516 + 278025252517.
It is an arithmetic number, because the mean of its divisors is an integer number (278025252517).
Almost surely, 2556050505033 is an apocalyptic number.
It is an amenable number.
556050505033 is a deficient number, since it is larger than the sum of its proper divisors (1).
556050505033 is an equidigital number, since it uses as much as digits as its factorization.
556050505033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168750, while the sum is 37.
Adding to 556050505033 its reverse (330505050655), we get a palindrome (886555555688).
The spelling of 556050505033 in words is "five hundred fifty-six billion, fifty million, five hundred five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •