Base | Representation |
---|---|
bin | 10000000000111011100… |
… | …01011011011001000000 |
3 | 1221121022020102222220010 |
4 | 20000131301123121000 |
5 | 33003410324413100 |
6 | 1100441144544520 |
7 | 54516560652315 |
oct | 10003561333100 |
9 | 1847266388803 |
10 | 550255310400 |
11 | 1a23a8860a84 |
12 | 8a787482140 |
13 | 3cb72a6c333 |
14 | 1c8bd812d0c |
15 | e4a7b0a750 |
hex | 801dc5b640 |
550255310400 has 168 divisors, whose sum is σ = 1811961856384. Its totient is φ = 146192947200.
The previous prime is 550255310357. The next prime is 550255310417. The reversal of 550255310400 is 4013552055.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1089294 + ... + 1512306.
Almost surely, 2550255310400 is an apocalyptic number.
550255310400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550255310400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (905980928192).
550255310400 is an abundant number, since it is smaller than the sum of its proper divisors (1261706545984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550255310400 is a wasteful number, since it uses less digits than its factorization.
550255310400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423309 (or 423294 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
Adding to 550255310400 its reverse (4013552055), we get a palindrome (554268862455).
The spelling of 550255310400 in words is "five hundred fifty billion, two hundred fifty-five million, three hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •