Base | Representation |
---|---|
bin | 101111101100101… |
… | …0111100111110000 |
3 | 11010112121002212112 |
4 | 1133121113213300 |
5 | 11234211021442 |
6 | 422451544452 |
7 | 54442622366 |
oct | 13731274760 |
9 | 4115532775 |
10 | 1600485872 |
11 | 7514837a7 |
12 | 387bbb128 |
13 | 1c6775c7b |
14 | 1127bd636 |
15 | 95798082 |
hex | 5f6579f0 |
1600485872 has 40 divisors (see below), whose sum is σ = 3251882640. Its totient is φ = 762048000.
The previous prime is 1600485871. The next prime is 1600485917. The reversal of 1600485872 is 2785840061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1600485871) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10247 + ... + 57497.
It is an arithmetic number, because the mean of its divisors is an integer number (81297066).
Almost surely, 21600485872 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 1600485872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1625941320).
1600485872 is an abundant number, since it is smaller than the sum of its proper divisors (1651396768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1600485872 is a wasteful number, since it uses less digits than its factorization.
1600485872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47361 (or 47355 counting only the distinct ones).
The product of its (nonzero) digits is 107520, while the sum is 41.
The square root of 1600485872 is about 40006.0729389926. The cubic root of 1600485872 is about 1169.7254748321.
The spelling of 1600485872 in words is "one billion, six hundred million, four hundred eighty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •