Base | Representation |
---|---|
bin | 101111101110010… |
… | …0100110000000000 |
3 | 11010121011210102100 |
4 | 1133130210300000 |
5 | 11234414413310 |
6 | 422521550400 |
7 | 54453022104 |
oct | 13734446000 |
9 | 4117153370 |
10 | 1601326080 |
11 | 7519a7a92 |
12 | 388345400 |
13 | 1c69ab533 |
14 | 11295b904 |
15 | 958b1ec0 |
hex | 5f724c00 |
1601326080 has 528 divisors, whose sum is σ = 6131174400. Its totient is φ = 384860160.
The previous prime is 1601326073. The next prime is 1601326081. The reversal of 1601326080 is 806231061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1601326081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 27141091 + ... + 27141149.
Almost surely, 21601326080 is an apocalyptic number.
1601326080 is a gapful number since it is divisible by the number (10) 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 1601326080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3065587200).
1601326080 is an abundant number, since it is smaller than the sum of its proper divisors (4529848320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1601326080 is a wasteful number, since it uses less digits than its factorization.
1601326080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 1601326080 is about 40016.5725668753. The cubic root of 1601326080 is about 1169.9301295115.
The spelling of 1601326080 in words is "one billion, six hundred one million, three hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •