Base | Representation |
---|---|
bin | 11010010001100… |
… | …01100100111111 |
3 | 120100201200111021 |
4 | 31020301210333 |
5 | 422410412111 |
6 | 33512005011 |
7 | 5314255231 |
oct | 1510614477 |
9 | 510650437 |
10 | 220404031 |
11 | 1034598a1 |
12 | 61990767 |
13 | 3687c5b3 |
14 | 213b4251 |
15 | 14539d71 |
hex | d23193f |
220404031 has 8 divisors (see below), whose sum is σ = 241416720. Its totient is φ = 200285568.
The previous prime is 220404013. The next prime is 220404053. The reversal of 220404031 is 130404022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220404031 - 211 = 220401983 is a prime.
It is a super-2 number, since 2×2204040312 = 97155873762097922, 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 = 220403996 and 220404014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220404011) 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, 223041 + ... + 224026.
It is an arithmetic number, because the mean of its divisors is an integer number (30177090).
Almost surely, 2220404031 is an apocalyptic number.
220404031 is a deficient number, since it is larger than the sum of its proper divisors (21012689).
220404031 is a wasteful number, since it uses less digits than its factorization.
220404031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447113.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 220404031 is about 14846.0106089144. The cubic root of 220404031 is about 604.0504020262.
Adding to 220404031 its reverse (130404022), we get a palindrome (350808053).
Subtracting from 220404031 its reverse (130404022), we obtain a palindrome (90000009).
The spelling of 220404031 in words is "two hundred twenty million, four hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •