Base | Representation |
---|---|
bin | 10100000110101… |
… | …10001011011000 |
3 | 102202100021112021 |
4 | 22003112023120 |
5 | 321133240212 |
6 | 24422424224 |
7 | 4115332210 |
oct | 1203261330 |
9 | 382307467 |
10 | 168649432 |
11 | 8721a8a6 |
12 | 48592074 |
13 | 28c2b683 |
14 | 18581240 |
15 | ec15307 |
hex | a0d62d8 |
168649432 has 48 divisors (see below), whose sum is σ = 377853840. Its totient is φ = 69123648.
The previous prime is 168649427. The next prime is 168649433. The reversal of 168649432 is 234946861.
It is a happy number.
168649432 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 not an unprimeable number, because it can be changed into a prime (168649433) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26778 + ... + 32470.
It is an arithmetic number, because the mean of its divisors is an integer number (7871955).
Almost surely, 2168649432 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 168649432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188926920).
168649432 is an abundant number, since it is smaller than the sum of its proper divisors (209204408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168649432 is a wasteful number, since it uses less digits than its factorization.
168649432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5752 (or 5725 counting only the distinct ones).
The product of its digits is 248832, while the sum is 43.
The square root of 168649432 is about 12986.5096157513. The cubic root of 168649432 is about 552.4949264837.
The spelling of 168649432 in words is "one hundred sixty-eight million, six hundred forty-nine thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •