Base | Representation |
---|---|
bin | 10100000001110… |
… | …10111011110000 |
3 | 102201010222021011 |
4 | 22000322323300 |
5 | 321002413202 |
6 | 24401040304 |
7 | 4110043300 |
oct | 1200727360 |
9 | 381128234 |
10 | 168013552 |
11 | 86926083 |
12 | 48326094 |
13 | 28a68105 |
14 | 18457600 |
15 | eb3bbd7 |
hex | a03aef0 |
168013552 has 90 divisors (see below), whose sum is σ = 393037344. Its totient is φ = 69370560.
The previous prime is 168013541. The next prime is 168013589. The reversal of 168013552 is 255310861.
168013552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 753313 + ... + 753535.
Almost surely, 2168013552 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 168013552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196518672).
168013552 is an abundant number, since it is smaller than the sum of its proper divisors (225023792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168013552 is a wasteful number, since it uses less digits than its factorization.
168013552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307 (or 263 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 168013552 is about 12962.0041660231. The cubic root of 168013552 is about 551.7996717584.
The spelling of 168013552 in words is "one hundred sixty-eight million, thirteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •