Base | Representation |
---|---|
bin | 110001110101000… |
… | …1111000100000000 |
3 | 11022112012012221021 |
4 | 1203222033010000 |
5 | 11411014004003 |
6 | 433525035224 |
7 | 56301621406 |
oct | 14352170400 |
9 | 4275165837 |
10 | 1672016128 |
11 | 78889a512 |
12 | 3a7b55b14 |
13 | 20852c173 |
14 | 11c0bd476 |
15 | 9bbc72bd |
hex | 63a8f100 |
1672016128 has 72 divisors (see below), whose sum is σ = 3437174048. Its totient is φ = 811302912.
The previous prime is 1672016057. The next prime is 1672016167. The reversal of 1672016128 is 8216102761.
It is a super-2 number, since 2×16720161282 = 5591275864584224768, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1672016093 and 1672016102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2124151 + ... + 2124937.
Almost surely, 21672016128 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 1672016128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1718587024).
1672016128 is an abundant number, since it is smaller than the sum of its proper divisors (1765157920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1672016128 is an equidigital number, since it uses as much as digits as its factorization.
1672016128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1039 (or 1025 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 34.
The square root of 1672016128 is about 40890.2938116126. The cubic root of 1672016128 is about 1186.8982443024.
Adding to 1672016128 its reverse (8216102761), we get a palindrome (9888118889).
The spelling of 1672016128 in words is "one billion, six hundred seventy-two million, sixteen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.048 sec. • engine limits •