Base | Representation |
---|---|
bin | 10000000000111011100… |
… | …00010100100111011110 |
3 | 1221121022012220021020110 |
4 | 20000131300110213132 |
5 | 33003410241124020 |
6 | 1100441134430450 |
7 | 54516555334206 |
oct | 10003560244736 |
9 | 1847265807213 |
10 | 550255020510 |
11 | 1a23a86831a8 |
12 | 8a787362426 |
13 | 3cb7299a3c0 |
14 | 1c8bd779406 |
15 | e4a7a9e8e0 |
hex | 801dc149de |
550255020510 has 128 divisors (see below), whose sum is σ = 1437050595456. Its totient is φ = 134034278400.
The previous prime is 550255020509. The next prime is 550255020551. The reversal of 550255020510 is 15020552055.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 134436024 + ... + 134440116.
It is an arithmetic number, because the mean of its divisors is an integer number (11226957777).
Almost surely, 2550255020510 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550255020510, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (718525297728).
550255020510 is an abundant number, since it is smaller than the sum of its proper divisors (886795574946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550255020510 is a wasteful number, since it uses less digits than its factorization.
550255020510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7630.
The product of its (nonzero) digits is 12500, while the sum is 30.
Adding to 550255020510 its reverse (15020552055), we get a palindrome (565275572565).
The spelling of 550255020510 in words is "five hundred fifty billion, two hundred fifty-five million, twenty thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •