Base | Representation |
---|---|
bin | 11010010011100… |
… | …10110000110111 |
3 | 120101020020202011 |
4 | 31021302300313 |
5 | 422442433111 |
6 | 33521425051 |
7 | 5316446530 |
oct | 1511626067 |
9 | 511206664 |
10 | 220671031 |
11 | 103621459 |
12 | 61a9b187 |
13 | 36943c99 |
14 | 21443687 |
15 | 1458e021 |
hex | d272c37 |
220671031 has 8 divisors (see below), whose sum is σ = 252418464. Its totient is φ = 188979360.
The previous prime is 220671029. The next prime is 220671047. The reversal of 220671031 is 130176022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220671031 - 21 = 220671029 is a prime.
It is a super-2 number, since 2×2206710312 = 97391407845205922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220670993 and 220671011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220671331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5080 + ... + 21613.
It is an arithmetic number, because the mean of its divisors is an integer number (31552308).
Almost surely, 2220671031 is an apocalyptic number.
220671031 is a deficient number, since it is larger than the sum of its proper divisors (31747433).
220671031 is a wasteful number, since it uses less digits than its factorization.
220671031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27881.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 220671031 is about 14855.0002019522. Note that the first 3 decimals coincide. The cubic root of 220671031 is about 604.2942214856.
It can be divided in two parts, 2206 and 71031, that added together give a palindrome (73237).
The spelling of 220671031 in words is "two hundred twenty million, six hundred seventy-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.440 sec. • engine limits •