Base | Representation |
---|---|
bin | 10000000101010100110… |
… | …11000001110101010000 |
3 | 1221211101200122222011012 |
4 | 20002222123001311100 |
5 | 33023223421313000 |
6 | 1101511241510052 |
7 | 54632213134532 |
oct | 10025233016520 |
9 | 1854350588135 |
10 | 552615026000 |
11 | 1a33a9859264 |
12 | 8b1257a2328 |
13 | 4015a8c1b5b |
14 | 1ca64d87852 |
15 | e594d75735 |
hex | 80aa6c1d50 |
552615026000 has 80 divisors (see below), whose sum is σ = 1336642486608. Its totient is φ = 220976640000.
The previous prime is 552615025967. The next prime is 552615026023. The reversal of 552615026000 is 620516255.
It can be written as a sum of positive squares in 8 ways, for example, as 36068087056 + 516546938944 = 189916^2 + 718712^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6584300 + ... + 6667700.
Almost surely, 2552615026000 is an apocalyptic number.
552615026000 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 552615026000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (668321243304).
552615026000 is an abundant number, since it is smaller than the sum of its proper divisors (784027460608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552615026000 is a wasteful number, since it uses less digits than its factorization.
552615026000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86737 (or 86721 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 552615026000 in words is "five hundred fifty-two billion, six hundred fifteen million, twenty-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •