Base | Representation |
---|---|
bin | 11010010000110… |
… | …10111100100011 |
3 | 120100112222022221 |
4 | 31020122330203 |
5 | 422344430311 |
6 | 33510011511 |
7 | 5313421042 |
oct | 1510327443 |
9 | 510488287 |
10 | 220311331 |
11 | 1033a6189 |
12 | 61946b97 |
13 | 36849346 |
14 | 2138c559 |
15 | 1451c671 |
hex | d21af23 |
220311331 has 4 divisors (see below), whose sum is σ = 220902352. Its totient is φ = 219720312.
The previous prime is 220311323. The next prime is 220311337. The reversal of 220311331 is 133113022.
220311331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 220311331 - 23 = 220311323 is a prime.
It is a super-2 number, since 2×2203113312 = 97074165133983122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220311337) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 294951 + ... + 295696.
It is an arithmetic number, because the mean of its divisors is an integer number (55225588).
Almost surely, 2220311331 is an apocalyptic number.
220311331 is a deficient number, since it is larger than the sum of its proper divisors (591021).
220311331 is an equidigital number, since it uses as much as digits as its factorization.
220311331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 591020.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 220311331 is about 14842.8882297213. Note that the first 3 decimals coincide. The cubic root of 220311331 is about 603.9657040524.
Adding to 220311331 its reverse (133113022), we get a palindrome (353424353).
The spelling of 220311331 in words is "two hundred twenty million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •