Base | Representation |
---|---|
bin | 10000000110000001010… |
… | …10011101100000000000 |
3 | 1221212100200210122211020 |
4 | 20003000222131200000 |
5 | 33030004432421430 |
6 | 1102012251345440 |
7 | 54644363614602 |
oct | 10030052354000 |
9 | 1855320718736 |
10 | 552988170240 |
11 | 1a3580451030 |
12 | 8b20a752280 |
13 | 401b9cbc66c |
14 | 1ca9c75b172 |
15 | e5b79d1b10 |
hex | 80c0a9d800 |
552988170240 has 768 divisors, whose sum is σ = 1985947891200. Its totient is φ = 130233139200.
The previous prime is 552988170223. The next prime is 552988170253. The reversal of 552988170240 is 42071889255.
It is a tau number, because it is divible by the number of its divisors (768).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2865223584 + ... + 2865223776.
It is an arithmetic number, because the mean of its divisors is an integer number (2585869650).
Almost surely, 2552988170240 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 552988170240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (992973945600).
552988170240 is an abundant number, since it is smaller than the sum of its proper divisors (1432959720960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552988170240 is a wasteful number, since it uses less digits than its factorization.
552988170240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434 (or 414 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 51.
The spelling of 552988170240 in words is "five hundred fifty-two billion, nine hundred eighty-eight million, one hundred seventy thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •