Base | Representation |
---|---|
bin | 101111110011011… |
… | …0101100000100000 |
3 | 11010210020110111221 |
4 | 1133212311200200 |
5 | 11241112004120 |
6 | 423055344424 |
7 | 54514624645 |
oct | 13746654040 |
9 | 4123213457 |
10 | 1604016160 |
11 | 75347509a |
12 | 389222114 |
13 | 1c7410ab6 |
14 | 11305bdcc |
15 | 95c440aa |
hex | 5f9b5820 |
1604016160 has 24 divisors (see below), whose sum is σ = 3789488556. Its totient is φ = 641606400.
The previous prime is 1604016149. The next prime is 1604016163. The reversal of 1604016160 is 616104061.
It can be written as a sum of positive squares in 2 ways, for example, as 1529435664 + 74580496 = 39108^2 + 8636^2 .
It is a super-2 number, since 2×16040161602 = 5145735683082291200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (25) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1604016163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5012391 + ... + 5012710.
Almost surely, 21604016160 is an apocalyptic number.
1604016160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1604016160 is an abundant number, since it is smaller than the sum of its proper divisors (2185472396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1604016160 is a wasteful number, since it uses less digits than its factorization.
1604016160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10025116 (or 10025108 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
The square root of 1604016160 is about 40050.1705364659. The cubic root of 1604016160 is about 1170.5848878785.
The spelling of 1604016160 in words is "one billion, six hundred four million, sixteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •