Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …00111101101011101101 |
3 | 1221121221022220201221000 |
4 | 20000230120331223231 |
5 | 33004411120234001 |
6 | 1100521345230513 |
7 | 54525626341521 |
oct | 10005430755355 |
9 | 1847838821830 |
10 | 550500555501 |
11 | 1a2514237286 |
12 | 8a835632439 |
13 | 3cbb1808690 |
14 | 1c904211d81 |
15 | e4be400a86 |
hex | 802c63daed |
550500555501 has 32 divisors (see below), whose sum is σ = 878344024320. Its totient is φ = 338749307712.
The previous prime is 550500555469. The next prime is 550500555509. The reversal of 550500555501 is 105555005055.
It is a happy number.
550500555501 is a `hidden beast` number, since 5 + 5 + 0 + 50 + 0 + 55 + 550 + 1 = 666.
It is not a de Polignac number, because 550500555501 - 25 = 550500555469 is a prime.
It is a super-2 number, since 2×5505005555012 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (550500555509) 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 in 31 ways as a sum of consecutive naturals, for example, 7604191 + ... + 7676243.
It is an arithmetic number, because the mean of its divisors is an integer number (27448250760).
Almost surely, 2550500555501 is an apocalyptic number.
It is an amenable number.
550500555501 is a deficient number, since it is larger than the sum of its proper divisors (327843468819).
550500555501 is a wasteful number, since it uses less digits than its factorization.
550500555501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93842 (or 93836 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 36.
The spelling of 550500555501 in words is "five hundred fifty billion, five hundred million, five hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •