Base | Representation |
---|---|
bin | 110111111011111010… |
… | …100010001101110000 |
3 | 12202000202100221210020 |
4 | 313323322202031300 |
5 | 1441001104004220 |
6 | 43331443403440 |
7 | 4224240036621 |
oct | 677372421560 |
9 | 182022327706 |
10 | 60061000560 |
11 | 23520961750 |
12 | b782383580 |
13 | 58822976b2 |
14 | 2c9aa11a48 |
15 | 1867ca2040 |
hex | dfbea2370 |
60061000560 has 80 divisors (see below), whose sum is σ = 203115392640. Its totient is φ = 14560241920.
The previous prime is 60061000547. The next prime is 60061000589. The reversal of 60061000560 is 6500016006.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 60061000560.
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, 11372550 + ... + 11377829.
It is an arithmetic number, because the mean of its divisors is an integer number (2538942408).
Almost surely, 260061000560 is an apocalyptic number.
60061000560 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
60061000560 is an abundant number, since it is smaller than the sum of its proper divisors (143054392080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60061000560 is a wasteful number, since it uses less digits than its factorization.
60061000560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22750406 (or 22750400 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 60061000560 its reverse (6500016006), we get a palindrome (66561016566).
The spelling of 60061000560 in words is "sixty billion, sixty-one million, five hundred sixty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •