Base | Representation |
---|---|
bin | 110100001101011101… |
… | …110110101110101000 |
3 | 12100200221201201120000 |
4 | 310031131312232220 |
5 | 1404302442130000 |
6 | 41430455103000 |
7 | 4023142300353 |
oct | 641535665650 |
9 | 170627651500 |
10 | 56060505000 |
11 | 2185876a175 |
12 | aa46671a60 |
13 | 5395531566 |
14 | 29db5ad29a |
15 | 16d1980000 |
hex | d0d776ba8 |
56060505000 has 400 divisors, whose sum is σ = 197743342500. Its totient is φ = 14833152000.
The previous prime is 56060504987. The next prime is 56060505091. The reversal of 56060505000 is 50506065.
56060505000 is a `hidden beast` number, since 5 + 6 + 0 + 605 + 0 + 50 + 0 + 0 = 666.
It can be written as a sum of positive squares in 10 ways, for example, as 30240514404 + 25819990596 = 173898^2 + 160686^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 60344536 + ... + 60345464.
Almost surely, 256060505000 is an apocalyptic number.
56060505000 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 56060505000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98871671250).
56060505000 is an abundant number, since it is smaller than the sum of its proper divisors (141682837500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56060505000 is a wasteful number, since it uses less digits than its factorization.
56060505000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1116 (or 1088 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 56060505000 in words is "fifty-six billion, sixty million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •