Base | Representation |
---|---|
bin | 1001100011001000010… |
… | …0110101010100000000 |
3 | 120200102211220211001100 |
4 | 2120302010311110000 |
5 | 10141433003304432 |
6 | 203210224534400 |
7 | 14565166341426 |
oct | 2306204652400 |
9 | 520384824040 |
10 | 164048884992 |
11 | 63633356403 |
12 | 27963781400 |
13 | 12615046065 |
14 | 7d23551116 |
15 | 440216c07c |
hex | 2632135500 |
164048884992 has 108 divisors (see below), whose sum is σ = 473314068864. Its totient is φ = 54645888000.
The previous prime is 164048884957. The next prime is 164048885041. The reversal of 164048884992 is 299488840461.
164048884992 is a `hidden beast` number, since 1 + 64 + 0 + 4 + 8 + 88 + 499 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 3485617 + ... + 3532367.
Almost surely, 2164048884992 is an apocalyptic number.
164048884992 is a gapful number since it is divisible by the number (12) 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 164048884992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (236657034432).
164048884992 is an abundant number, since it is smaller than the sum of its proper divisors (309265183872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164048884992 is a wasteful number, since it uses less digits than its factorization.
164048884992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48296 (or 48279 counting only the distinct ones).
The product of its (nonzero) digits is 31850496, while the sum is 63.
The spelling of 164048884992 in words is "one hundred sixty-four billion, forty-eight million, eight hundred eighty-four thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •