Base | Representation |
---|---|
bin | 10000000000100000001… |
… | …00001111001010100001 |
3 | 1221120201012202022021212 |
4 | 20000100010033022201 |
5 | 33002422443010113 |
6 | 1100402252155505 |
7 | 54511066264142 |
oct | 10002004171241 |
9 | 1846635668255 |
10 | 550025360033 |
11 | 1a229aa81956 |
12 | 8a722468b95 |
13 | 3cb37229826 |
14 | 1c89b075ac9 |
15 | e4928370a8 |
hex | 801010f2a1 |
550025360033 has 2 divisors, whose sum is σ = 550025360034. Its totient is φ = 550025360032.
The previous prime is 550025360023. The next prime is 550025360039. The reversal of 550025360033 is 330063520055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 530642316304 + 19383043729 = 728452^2 + 139223^2 .
It is a cyclic number.
It is not a de Polignac number, because 550025360033 - 212 = 550025355937 is a prime.
It is a super-2 number, since 2×5500253600332 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (550025360039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275012680016 + 275012680017.
It is an arithmetic number, because the mean of its divisors is an integer number (275012680017).
Almost surely, 2550025360033 is an apocalyptic number.
It is an amenable number.
550025360033 is a deficient number, since it is larger than the sum of its proper divisors (1).
550025360033 is an equidigital number, since it uses as much as digits as its factorization.
550025360033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 32.
Adding to 550025360033 its reverse (330063520055), we get a palindrome (880088880088).
The spelling of 550025360033 in words is "five hundred fifty billion, twenty-five million, three hundred sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •