Base | Representation |
---|---|
bin | 100111000100101… |
… | …111101111011110 |
3 | 1200200112200011012 |
4 | 213010233233132 |
5 | 2320310234200 |
6 | 145014455222 |
7 | 22150062446 |
oct | 4704575736 |
9 | 1620480135 |
10 | 655555550 |
11 | 307053651 |
12 | 163664512 |
13 | a5a7a8c0 |
14 | 630c9126 |
15 | 3c843a35 |
hex | 2712fbde |
655555550 has 24 divisors (see below), whose sum is σ = 1313129496. Its totient is φ = 242051040.
The previous prime is 655555531. The next prime is 655555559. The reversal of 655555550 is 55555556.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a Curzon number.
It is a nialpdrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 655555498 and 655555507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (655555559) 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 11 ways as a sum of consecutive naturals, for example, 503624 + ... + 504923.
It is an arithmetic number, because the mean of its divisors is an integer number (54713729).
Almost surely, 2655555550 is an apocalyptic number.
655555550 is an abundant number, since it is smaller than the sum of its proper divisors (657573946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
655555550 is a wasteful number, since it uses less digits than its factorization.
655555550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008572 (or 1008567 counting only the distinct ones).
The product of its (nonzero) digits is 468750, while the sum is 41.
The square root of 655555550 is about 25603.8190510713. The cubic root of 655555550 is about 868.7000226585.
The spelling of 655555550 in words is "six hundred fifty-five million, five hundred fifty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •