Base | Representation |
---|---|
bin | 10100000100110… |
… | …00101101010100 |
3 | 102201212111011002 |
4 | 22002120231110 |
5 | 321102211102 |
6 | 24413202432 |
7 | 4113233153 |
oct | 1202305524 |
9 | 381774132 |
10 | 168397652 |
11 | 87068715 |
12 | 48490418 |
13 | 28b70ba7 |
14 | 1851759a |
15 | ebb5902 |
hex | a098b54 |
168397652 has 6 divisors (see below), whose sum is σ = 294695898. Its totient is φ = 84198824.
The previous prime is 168397643. The next prime is 168397661. The reversal of 168397652 is 256793861.
It is an interprime number because it is at equal distance from previous prime (168397643) and next prime (168397661).
It can be written as a sum of positive squares in only one way, i.e., 92428996 + 75968656 = 9614^2 + 8716^2 .
It is a super-2 number, since 2×1683976522 = 56715538398226208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 168397597 and 168397606.
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 as a sum of consecutive naturals, namely, 21049703 + ... + 21049710.
It is an arithmetic number, because the mean of its divisors is an integer number (49115983).
Almost surely, 2168397652 is an apocalyptic number.
It is an amenable number.
168397652 is a deficient number, since it is larger than the sum of its proper divisors (126298246).
168397652 is a wasteful number, since it uses less digits than its factorization.
168397652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42099417 (or 42099415 counting only the distinct ones).
The product of its digits is 544320, while the sum is 47.
The square root of 168397652 is about 12976.8120892614. The cubic root of 168397652 is about 552.2198460922.
The spelling of 168397652 in words is "one hundred sixty-eight million, three hundred ninety-seven thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •