Base | Representation |
---|---|
bin | 10100000011000… |
… | …00101100110000 |
3 | 102201102211110100 |
4 | 22001200230300 |
5 | 321022340430 |
6 | 24404232400 |
7 | 4111256262 |
oct | 1201405460 |
9 | 381384410 |
10 | 168168240 |
11 | 86a21319 |
12 | 4839b700 |
13 | 28ac0646 |
14 | 18497b32 |
15 | eb6c960 |
hex | a060b30 |
168168240 has 180 divisors, whose sum is σ = 596975184. Its totient is φ = 42418944.
The previous prime is 168168239. The next prime is 168168251. The reversal of 168168240 is 42861861.
It is a tau number, because it is divible by the number of its divisors (180).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 168168195 and 168168204.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 259597 + ... + 260243.
Almost surely, 2168168240 is an apocalyptic number.
168168240 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 168168240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (298487592).
168168240 is an abundant number, since it is smaller than the sum of its proper divisors (428806944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168168240 is a wasteful number, since it uses less digits than its factorization.
168168240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704 (or 676 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The square root of 168168240 is about 12967.9697717106. The cubic root of 168168240 is about 551.9689648588.
The spelling of 168168240 in words is "one hundred sixty-eight million, one hundred sixty-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •