Base | Representation |
---|---|
bin | 11000100100111… |
… | …01000111000110 |
3 | 112100221020102100 |
4 | 30102131013012 |
5 | 410234230142 |
6 | 32242452530 |
7 | 5052240312 |
oct | 1422350706 |
9 | 470836370 |
10 | 206164422 |
11 | a6413422 |
12 | 59064146 |
13 | 339350a9 |
14 | 1d548b42 |
15 | 13175b4c |
hex | c49d1c6 |
206164422 has 36 divisors (see below), whose sum is σ = 462657780. Its totient is φ = 66346896.
The previous prime is 206164417. The next prime is 206164429. The reversal of 206164422 is 224461602.
206164422 is a `hidden beast` number, since 2 + 0 + 616 + 4 + 42 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206164429) 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 17 ways as a sum of consecutive naturals, for example, 8329 + ... + 21947.
It is an arithmetic number, because the mean of its divisors is an integer number (12851605).
Almost surely, 2206164422 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 206164422, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231328890).
206164422 is an abundant number, since it is smaller than the sum of its proper divisors (256493358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206164422 is a wasteful number, since it uses less digits than its factorization.
206164422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13685 (or 13653 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 206164422 is about 14358.4268636923. The cubic root of 206164422 is about 590.7511470874.
The spelling of 206164422 in words is "two hundred six million, one hundred sixty-four thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.317 sec. • engine limits •