Base | Representation |
---|---|
bin | 11010010001001… |
… | …11001001110001 |
3 | 120100122111220201 |
4 | 31020213021301 |
5 | 422403030304 |
6 | 33511035201 |
7 | 5314016566 |
oct | 1510471161 |
9 | 510574821 |
10 | 220361329 |
11 | 10342a801 |
12 | 6196bb01 |
13 | 36866026 |
14 | 213a286d |
15 | 1452c3a4 |
hex | d227271 |
220361329 has 2 divisors, whose sum is σ = 220361330. Its totient is φ = 220361328.
The previous prime is 220361311. The next prime is 220361357. The reversal of 220361329 is 923163022.
It is an a-pointer prime, because the next prime (220361357) can be obtained adding 220361329 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 219721329 + 640000 = 14823^2 + 800^2 .
It is a cyclic number.
It is not a de Polignac number, because 220361329 - 27 = 220361201 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 220361297 and 220361306.
It is not a weakly prime, because it can be changed into another prime (220361389) 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 as a sum of consecutive naturals, namely, 110180664 + 110180665.
It is an arithmetic number, because the mean of its divisors is an integer number (110180665).
Almost surely, 2220361329 is an apocalyptic number.
It is an amenable number.
220361329 is a deficient number, since it is larger than the sum of its proper divisors (1).
220361329 is an equidigital number, since it uses as much as digits as its factorization.
220361329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 220361329 is about 14844.5723751141. The cubic root of 220361329 is about 604.0113890883.
The spelling of 220361329 in words is "two hundred twenty million, three hundred sixty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •