Base | Representation |
---|---|
bin | 110111111000010110… |
… | …001010000100000000 |
3 | 12201212120201100122210 |
4 | 313320112022010000 |
5 | 1440340242222200 |
6 | 43321504302120 |
7 | 4222612133220 |
oct | 677026120400 |
9 | 181776640583 |
10 | 60001132800 |
11 | 234a0091164 |
12 | b766311940 |
13 | 5872a6599b |
14 | 2c92aaa080 |
15 | 18628c8650 |
hex | df858a100 |
60001132800 has 432 divisors, whose sum is σ = 239625412992. Its totient is φ = 12907315200.
The previous prime is 60001132787. The next prime is 60001132831. The reversal of 60001132800 is 823110006.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2271670 + ... + 2297930.
It is an arithmetic number, because the mean of its divisors is an integer number (554688456).
Almost surely, 260001132800 is an apocalyptic number.
60001132800 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 60001132800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119812706496).
60001132800 is an abundant number, since it is smaller than the sum of its proper divisors (179624280192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60001132800 is a wasteful number, since it uses less digits than its factorization.
60001132800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26314 (or 26295 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 60001132800 its reverse (823110006), we get a palindrome (60824242806).
The spelling of 60001132800 in words is "sixty billion, one million, one hundred thirty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •