Base | Representation |
---|---|
bin | 110110111001100001… |
… | …011100011011100000 |
3 | 12122011010102022112020 |
4 | 312321201130123200 |
5 | 1431210431031013 |
6 | 43025133301440 |
7 | 4154523212100 |
oct | 667141343340 |
9 | 178133368466 |
10 | 58947127008 |
11 | 22aaa130aa0 |
12 | b511334880 |
13 | 573559a013 |
14 | 2bd2b01200 |
15 | 18000ca623 |
hex | db985c6e0 |
58947127008 has 576 divisors, whose sum is σ = 205228235520. Its totient is φ = 14631321600.
The previous prime is 58947126991. The next prime is 58947127027. The reversal of 58947127008 is 80072174985.
58947127008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 244593768 + ... + 244594008.
It is an arithmetic number, because the mean of its divisors is an integer number (356299020).
Almost surely, 258947127008 is an apocalyptic number.
58947127008 is a gapful number since it is divisible by the number (58) 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 58947127008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102614117760).
58947127008 is an abundant number, since it is smaller than the sum of its proper divisors (146281108512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58947127008 is a wasteful number, since it uses less digits than its factorization.
58947127008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 471 (or 456 counting only the distinct ones).
The product of its (nonzero) digits is 1128960, while the sum is 51.
The spelling of 58947127008 in words is "fifty-eight billion, nine hundred forty-seven million, one hundred twenty-seven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •