Base | Representation |
---|---|
bin | 100011110111001… |
… | …100110111000000 |
3 | 1112221011011101211 |
4 | 203313030313000 |
5 | 2213012020102 |
6 | 135411535504 |
7 | 20624065063 |
oct | 4367146700 |
9 | 1487134354 |
10 | 601673152 |
11 | 2896a0a43 |
12 | 1495ba594 |
13 | 97863322 |
14 | 59ca08da |
15 | 37c4d7d7 |
hex | 23dccdc0 |
601673152 has 56 divisors (see below), whose sum is σ = 1269989840. Its totient is φ = 282009600.
The previous prime is 601673147. The next prime is 601673153. The reversal of 601673152 is 251376106.
601673152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (601673153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115402 + ... + 120502.
It is an arithmetic number, because the mean of its divisors is an integer number (22678390).
Almost surely, 2601673152 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 601673152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (634994920).
601673152 is an abundant number, since it is smaller than the sum of its proper divisors (668316688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601673152 is a wasteful number, since it uses less digits than its factorization.
601673152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5229 (or 5219 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 601673152 is about 24529.0267234556. The cubic root of 601673152 is about 844.2159327108.
The spelling of 601673152 in words is "six hundred one million, six hundred seventy-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •