Base | Representation |
---|---|
bin | 111000110101011011… |
… | …111001100000000000 |
3 | 12211112000021110000000 |
4 | 320311123321200000 |
5 | 1444440132014000 |
6 | 44011320000000 |
7 | 4260165564201 |
oct | 706533714000 |
9 | 184460243000 |
10 | 61026048000 |
11 | 23976682115 |
12 | b9b1600000 |
13 | 59a71b7598 |
14 | 2d4cc615a8 |
15 | 18c287c000 |
hex | e356f9800 |
61026048000 has 768 divisors, whose sum is σ = 230486256000. Its totient is φ = 16124313600.
The previous prime is 61026047989. The next prime is 61026048071. The reversal of 61026048000 is 84062016.
61026048000 is a `hidden beast` number, since 610 + 2 + 6 + 0 + 48 + 0 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (768).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 559871946 + ... + 559872054.
Almost surely, 261026048000 is an apocalyptic number.
61026048000 is a gapful number since it is divisible by the number (60) 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 61026048000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115243128000).
61026048000 is an abundant number, since it is smaller than the sum of its proper divisors (169460208000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61026048000 is an frugal number, since it uses more digits than its factorization.
61026048000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 61026048000 in words is "sixty-one billion, twenty-six million, forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •