Base | Representation |
---|---|
bin | 11011100110000011001000… |
… | …01101100110101000000000 |
3 | 21221212001012202222110211210 |
4 | 31303001210031212220000 |
5 | 30423144121141324233 |
6 | 333020242415010120 |
7 | 15532025143135413 |
oct | 1563014415465000 |
9 | 257761182873753 |
10 | 60680979245568 |
11 | 1837572791a440 |
12 | 6980469209940 |
13 | 27b2265492046 |
14 | 10dad9181db7a |
15 | 7036b8d71163 |
hex | 373064366a00 |
60680979245568 has 320 divisors, whose sum is σ = 182829983846400. Its totient is φ = 17715688488960.
The previous prime is 60680979245543. The next prime is 60680979245633. The reversal of 60680979245568 is 86554297908606.
It is a self number, because there is not a number n which added to its sum of digits gives 60680979245568.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226728853 + ... + 226996331.
It is an arithmetic number, because the mean of its divisors is an integer number (571343699520).
Almost surely, 260680979245568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 60680979245568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91414991923200).
60680979245568 is an abundant number, since it is smaller than the sum of its proper divisors (122149004600832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60680979245568 is a wasteful number, since it uses less digits than its factorization.
60680979245568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268003 (or 267987 counting only the distinct ones).
The product of its (nonzero) digits is 1567641600, while the sum is 75.
The spelling of 60680979245568 in words is "sixty trillion, six hundred eighty billion, nine hundred seventy-nine million, two hundred forty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •