Base | Representation |
---|---|
bin | 110111111110101010… |
… | …001010010100000000 |
3 | 12202010222000000000200 |
4 | 313332222022110000 |
5 | 1441044400240000 |
6 | 43340210245200 |
7 | 4225336260450 |
oct | 677652122400 |
9 | 182128000020 |
10 | 60107040000 |
11 | 23544947877 |
12 | b795886800 |
13 | 588b997177 |
14 | 2ca2b97d60 |
15 | 186bd48500 |
hex | dfea8a500 |
60107040000 has 1080 divisors, whose sum is σ = 254013439680. Its totient is φ = 13381632000.
The previous prime is 60107039987. The next prime is 60107040023. The reversal of 60107040000 is 4070106.
It is a super-2 number, since 2×601070400002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 675359956 + ... + 675360044.
Almost surely, 260107040000 is an apocalyptic number.
60107040000 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 60107040000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127006719840).
60107040000 is an abundant number, since it is smaller than the sum of its proper divisors (193906399680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60107040000 is an equidigital number, since it uses as much as digits as its factorization.
60107040000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The spelling of 60107040000 in words is "sixty billion, one hundred seven million, forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •