Base | Representation |
---|---|
bin | 10000000001011100101… |
… | …00110000000101001001 |
3 | 1221122000120222101011001 |
4 | 20000232110300011021 |
5 | 33004442422140031 |
6 | 1100524504535001 |
7 | 54526502223403 |
oct | 10005624600511 |
9 | 1848016871131 |
10 | 550533005641 |
11 | 1a2530590583 |
12 | 8a844481461 |
13 | 3cbb845a948 |
14 | 1c90865bb73 |
15 | e4c21b0861 |
hex | 802e530149 |
550533005641 has 2 divisors, whose sum is σ = 550533005642. Its totient is φ = 550533005640.
The previous prime is 550533005621. The next prime is 550533005677. The reversal of 550533005641 is 146500335055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 402945648400 + 147587357241 = 634780^2 + 384171^2 .
It is a cyclic number.
It is not a de Polignac number, because 550533005641 - 25 = 550533005609 is a prime.
It is a super-2 number, since 2×5505330056412 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 550533005641.
It is not a weakly prime, because it can be changed into another prime (550533005621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275266502820 + 275266502821.
It is an arithmetic number, because the mean of its divisors is an integer number (275266502821).
Almost surely, 2550533005641 is an apocalyptic number.
It is an amenable number.
550533005641 is a deficient number, since it is larger than the sum of its proper divisors (1).
550533005641 is an equidigital number, since it uses as much as digits as its factorization.
550533005641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 550533005641 in words is "five hundred fifty billion, five hundred thirty-three million, five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •