Base | Representation |
---|---|
bin | 1001110010101010001… |
… | …1110110100011100000 |
3 | 121002012101101220211210 |
4 | 2130222203312203200 |
5 | 10224002222003422 |
6 | 205140030310120 |
7 | 15103410263664 |
oct | 2345243664340 |
9 | 532171356753 |
10 | 168217766112 |
11 | 653825a8500 |
12 | 28727958340 |
13 | 12b2a947716 |
14 | 81db0a68a4 |
15 | 459815110c |
hex | 272a8f68e0 |
168217766112 has 144 divisors (see below), whose sum is σ = 501021835776. Its totient is φ = 49330617600.
The previous prime is 168217766089. The next prime is 168217766131. The reversal of 168217766112 is 211667712861.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 126523 + ... + 593669.
It is an arithmetic number, because the mean of its divisors is an integer number (3479318304).
Almost surely, 2168217766112 is an apocalyptic number.
168217766112 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 168217766112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250510917888).
168217766112 is an abundant number, since it is smaller than the sum of its proper divisors (332804069664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168217766112 is a wasteful number, since it uses less digits than its factorization.
168217766112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467213 (or 467194 counting only the distinct ones).
The product of its digits is 338688, while the sum is 48.
The spelling of 168217766112 in words is "one hundred sixty-eight billion, two hundred seventeen million, seven hundred sixty-six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •