Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …00101100010111001001 |
3 | 1221122002010101100011000 |
4 | 20000233220230113021 |
5 | 33010014040314010 |
6 | 1100531012325213 |
7 | 54530160242463 |
oct | 10005750542711 |
9 | 1848063340130 |
10 | 550555010505 |
11 | 1a2541a50115 |
12 | 8a84b913809 |
13 | 3cbbcb93786 |
14 | 1c90b549133 |
15 | e4c40aa7c0 |
hex | 802fa2c5c9 |
550555010505 has 32 divisors (see below), whose sum is σ = 978795198720. Its totient is φ = 293620118400.
The previous prime is 550555010497. The next prime is 550555010543. The reversal of 550555010505 is 505010555055.
It is a happy number.
550555010505 is a `hidden beast` number, since 5 + 50 + 5 + 550 + 1 + 0 + 50 + 5 = 666.
It is not a de Polignac number, because 550555010505 - 23 = 550555010497 is a prime.
It is a super-2 number, since 2×5505550105052 (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 550555010505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7978029 + ... + 8046741.
It is an arithmetic number, because the mean of its divisors is an integer number (30587349960).
Almost surely, 2550555010505 is an apocalyptic number.
It is an amenable number.
550555010505 is a deficient number, since it is larger than the sum of its proper divisors (428240188215).
550555010505 is a wasteful number, since it uses less digits than its factorization.
550555010505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128078 (or 128072 counting only the distinct ones).
The product of its (nonzero) digits is 78125, while the sum is 36.
The spelling of 550555010505 in words is "five hundred fifty billion, five hundred fifty-five million, ten thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •