Base | Representation |
---|---|
bin | 10100000001110… |
… | …00111111111100 |
3 | 102201010120101200 |
4 | 22000320333330 |
5 | 321002140003 |
6 | 24400535500 |
7 | 4110011220 |
oct | 1200707774 |
9 | 381116350 |
10 | 168005628 |
11 | 8692012a |
12 | 48321590 |
13 | 28a6461b |
14 | 18454780 |
15 | eb396a3 |
hex | a038ffc |
168005628 has 72 divisors (see below), whose sum is σ = 513912672. Its totient is φ = 45176832.
The previous prime is 168005623. The next prime is 168005653. The reversal of 168005628 is 826500861.
It is a happy number.
168005628 is a `hidden beast` number, since 16 + 80 + 0 + 562 + 8 = 666.
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 = 168005592 and 168005601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (168005623) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15325 + ... + 23892.
It is an arithmetic number, because the mean of its divisors is an integer number (7137676).
Almost surely, 2168005628 is an apocalyptic number.
168005628 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
168005628 is an abundant number, since it is smaller than the sum of its proper divisors (345907044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168005628 is a wasteful number, since it uses less digits than its factorization.
168005628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39251 (or 39246 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 168005628 is about 12961.6984998109. The cubic root of 168005628 is about 551.7909968047.
The spelling of 168005628 in words is "one hundred sixty-eight million, five thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •