Base | Representation |
---|---|
bin | 100011110101110… |
… | …111111001000000 |
3 | 1112220111110222202 |
4 | 203311313321000 |
5 | 2212414400440 |
6 | 135400252332 |
7 | 20621115314 |
oct | 4365677100 |
9 | 1486443882 |
10 | 601325120 |
11 | 289483510 |
12 | 1494710a8 |
13 | 97770aa6 |
14 | 59c0db44 |
15 | 37bd0615 |
hex | 23d77e40 |
601325120 has 112 divisors (see below), whose sum is σ = 1574596800. Its totient is φ = 216913920.
The previous prime is 601325119. The next prime is 601325149. The reversal of 601325120 is 21523106.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 601325092 and 601325101.
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, 488666 + ... + 489894.
It is an arithmetic number, because the mean of its divisors is an integer number (14058900).
Almost surely, 2601325120 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 601325120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (787298400).
601325120 is an abundant number, since it is smaller than the sum of its proper divisors (973271680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601325120 is a wasteful number, since it uses less digits than its factorization.
601325120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1396 (or 1386 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 601325120 is about 24521.9314084352. The cubic root of 601325120 is about 844.0531251422.
Adding to 601325120 its reverse (21523106), we get a palindrome (622848226).
The spelling of 601325120 in words is "six hundred one million, three hundred twenty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •