Base | Representation |
---|---|
bin | 10100000011110… |
… | …10001100101000 |
3 | 102201122010201111 |
4 | 22001322030220 |
5 | 321034211210 |
6 | 24410400104 |
7 | 4112202622 |
oct | 1201721450 |
9 | 381563644 |
10 | 168272680 |
11 | 86a92834 |
12 | 48430034 |
13 | 28b29044 |
14 | 184c3c12 |
15 | eb8d88a |
hex | a07a328 |
168272680 has 16 divisors (see below), whose sum is σ = 378613620. Its totient is φ = 67309056.
The previous prime is 168272677. The next prime is 168272693. The reversal of 168272680 is 86272861.
It can be written as a sum of positive squares in 2 ways, for example, as 141086884 + 27185796 = 11878^2 + 5214^2 .
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 4206817 = 168272680 / (1 + 6 + 8 + 2 + 7 + 2 + 6 + 8 + 0).
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 3 ways as a sum of consecutive naturals, for example, 2103369 + ... + 2103448.
Almost surely, 2168272680 is an apocalyptic number.
168272680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
168272680 is an abundant number, since it is smaller than the sum of its proper divisors (210340940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168272680 is a wasteful number, since it uses less digits than its factorization.
168272680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4206828 (or 4206824 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 40.
The square root of 168272680 is about 12971.9959913654. The cubic root of 168272680 is about 552.0832070187.
The spelling of 168272680 in words is "one hundred sixty-eight million, two hundred seventy-two thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •