Base | Representation |
---|---|
bin | 10100000111000… |
… | …10010010011100 |
3 | 102202102210120110 |
4 | 22003202102130 |
5 | 321141332121 |
6 | 24423450020 |
7 | 4115626632 |
oct | 1203422234 |
9 | 382383513 |
10 | 168699036 |
11 | 872540a0 |
12 | 485b6910 |
13 | 28c4811c |
14 | 18595352 |
15 | ec24d76 |
hex | a0e249c |
168699036 has 48 divisors (see below), whose sum is σ = 431278848. Its totient is φ = 50899200.
The previous prime is 168699023. The next prime is 168699067. The reversal of 168699036 is 630996861.
168699036 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29161 + ... + 34463.
It is an arithmetic number, because the mean of its divisors is an integer number (8984976).
Almost surely, 2168699036 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 168699036, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215639424).
168699036 is an abundant number, since it is smaller than the sum of its proper divisors (262579812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168699036 is a wasteful number, since it uses less digits than its factorization.
168699036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5562 (or 5560 counting only the distinct ones).
The product of its (nonzero) digits is 419904, while the sum is 48.
The square root of 168699036 is about 12988.4193033641. The cubic root of 168699036 is about 552.5490886818.
The spelling of 168699036 in words is "one hundred sixty-eight million, six hundred ninety-nine thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •