Base | Representation |
---|---|
bin | 10100000001110… |
… | …10111001010000 |
3 | 102201010222001020 |
4 | 22000322321100 |
5 | 321002412032 |
6 | 24401035440 |
7 | 4110042651 |
oct | 1200727120 |
9 | 381128036 |
10 | 168013392 |
11 | 86925a48 |
12 | 48325b80 |
13 | 28a68011 |
14 | 18457528 |
15 | eb3bb2c |
hex | a03ae50 |
168013392 has 80 divisors (see below), whose sum is σ = 445739328. Its totient is φ = 54512640.
The previous prime is 168013381. The next prime is 168013403. The reversal of 168013392 is 293310861.
It is an interprime number because it is at equal distance from previous prime (168013381) and next prime (168013403).
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, 536628 + ... + 536940.
Almost surely, 2168013392 is an apocalyptic number.
168013392 is a gapful number since it is divisible by the number (12) 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 168013392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222869664).
168013392 is an abundant number, since it is smaller than the sum of its proper divisors (277725936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168013392 is a wasteful number, since it uses less digits than its factorization.
168013392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588 (or 582 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 168013392 is about 12961.9979941366. The cubic root of 168013392 is about 551.7994965980.
The spelling of 168013392 in words is "one hundred sixty-eight million, thirteen thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •