Base | Representation |
---|---|
bin | 1100110100010110011… |
… | …1001000111000111111 |
3 | 210001101220021001011021 |
4 | 3031011213020320333 |
5 | 12101443033020111 |
6 | 245055202405011 |
7 | 21624016325515 |
oct | 3150547107077 |
9 | 701356231137 |
10 | 220211220031 |
11 | 85433546a30 |
12 | 36818360767 |
13 | 179c56ac07a |
14 | a93046a4b5 |
15 | 5adca13d71 |
hex | 33459c8e3f |
220211220031 has 8 divisors (see below), whose sum is σ = 240233864400. Its totient is φ = 200189149440.
The previous prime is 220211219929. The next prime is 220211220041. The reversal of 220211220031 is 130022112022.
It is a happy number.
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 220211220031 - 211 = 220211217983 is a prime.
It is a super-2 number, since 2×2202112200312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220211219987 and 220211220014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220211220041) 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, 1235055 + ... + 1402063.
It is an arithmetic number, because the mean of its divisors is an integer number (30029233050).
Almost surely, 2220211220031 is an apocalyptic number.
220211220031 is a deficient number, since it is larger than the sum of its proper divisors (20022644369).
220211220031 is a wasteful number, since it uses less digits than its factorization.
220211220031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286889.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 220211220031 its reverse (130022112022), we get a palindrome (350233332053).
The spelling of 220211220031 in words is "two hundred twenty billion, two hundred eleven million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •