Base | Representation |
---|---|
bin | 1001110011101100010… |
… | …0101010000100111000 |
3 | 121002220200200202112220 |
4 | 2130323010222010320 |
5 | 10230034132114313 |
6 | 205223324204040 |
7 | 15113313115326 |
oct | 2347304520470 |
9 | 532820622486 |
10 | 168494801208 |
11 | 65504a17028 |
12 | 287a4699620 |
13 | 12b73164706 |
14 | 8225bbcd16 |
15 | 45b2625823 |
hex | 273b12a138 |
168494801208 has 128 divisors (see below), whose sum is σ = 460788480000. Its totient is φ = 51146242560.
The previous prime is 168494801203. The next prime is 168494801219. The reversal of 168494801208 is 802108494861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (168494801203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2066266 + ... + 2146262.
It is an arithmetic number, because the mean of its divisors is an integer number (3599910000).
Almost surely, 2168494801208 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 168494801208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (230394240000).
168494801208 is an abundant number, since it is smaller than the sum of its proper divisors (292293678792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168494801208 is a wasteful number, since it uses less digits than its factorization.
168494801208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80205 (or 80201 counting only the distinct ones).
The product of its (nonzero) digits is 884736, while the sum is 51.
The spelling of 168494801208 in words is "one hundred sixty-eight billion, four hundred ninety-four million, eight hundred one thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •