Base | Representation |
---|---|
bin | 10100000100111… |
… | …10001110110100 |
3 | 102201220122012000 |
4 | 22002132032310 |
5 | 321103422101 |
6 | 24413455300 |
7 | 4113356133 |
oct | 1202361664 |
9 | 381818160 |
10 | 168420276 |
11 | 87083712 |
12 | 484a1530 |
13 | 28b7b28b |
14 | 1852191a |
15 | ebbc486 |
hex | a09e3b4 |
168420276 has 24 divisors (see below), whose sum is σ = 436645440. Its totient is φ = 56140056.
The previous prime is 168420257. The next prime is 168420277. The reversal of 168420276 is 672024861.
168420276 is a `hidden beast` number, since 168 + 420 + 2 + 76 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 168420276.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (168420277) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 779616 + ... + 779831.
It is an arithmetic number, because the mean of its divisors is an integer number (18193560).
Almost surely, 2168420276 is an apocalyptic number.
It is an amenable number.
168420276 is an abundant number, since it is smaller than the sum of its proper divisors (268225164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168420276 is a wasteful number, since it uses less digits than its factorization.
168420276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559460 (or 1559452 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 168420276 is about 12977.6837686854. The cubic root of 168420276 is about 552.2445749848.
The spelling of 168420276 in words is "one hundred sixty-eight million, four hundred twenty thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •