Base | Representation |
---|---|
bin | 11010010100101… |
… | …01110100100101 |
3 | 120101111112201121 |
4 | 31022111310211 |
5 | 423012032004 |
6 | 33524453541 |
7 | 5320615300 |
oct | 1512256445 |
9 | 511445647 |
10 | 220814629 |
11 | 10370a332 |
12 | 61b4a2b1 |
13 | 36994459 |
14 | 2147db37 |
15 | 145bb854 |
hex | d295d25 |
220814629 has 12 divisors (see below), whose sum is σ = 257248524. Its totient is φ = 188987904.
The previous prime is 220814623. The next prime is 220814663. The reversal of 220814629 is 926418022.
220814629 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 50381604 + 170433025 = 7098^2 + 13055^2 .
It is not a de Polignac number, because 220814629 - 23 = 220814621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220814594 and 220814603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220814621) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 34117 + ... + 40069.
It is an arithmetic number, because the mean of its divisors is an integer number (21437377).
Almost surely, 2220814629 is an apocalyptic number.
It is an amenable number.
220814629 is a deficient number, since it is larger than the sum of its proper divisors (36433895).
220814629 is an equidigital number, since it uses as much as digits as its factorization.
220814629 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6724 (or 6717 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 34.
The square root of 220814629 is about 14859.8327379550. The cubic root of 220814629 is about 604.4252711986.
The spelling of 220814629 in words is "two hundred twenty million, eight hundred fourteen thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •