Base | Representation |
---|---|
bin | 1011111111101110… |
… | …1101010011101011 |
3 | 22022102012001020020 |
4 | 2333323231103223 |
5 | 23043321202311 |
6 | 1251305531523 |
7 | 142540254420 |
oct | 27773552353 |
9 | 8272161206 |
10 | 3220100331 |
11 | 1402732048 |
12 | 75a4a3ba3 |
13 | 3c4188816 |
14 | 22793bd47 |
15 | 13ca6dc06 |
hex | bfeed4eb |
3220100331 has 32 divisors (see below), whose sum is σ = 5019107328. Its totient is φ = 1798073760.
The previous prime is 3220100327. The next prime is 3220100341. The reversal of 3220100331 is 1330010223.
It is not a de Polignac number, because 3220100331 - 22 = 3220100327 is a prime.
It is a super-2 number, since 2×32201003312 = 20738092283412619122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3220100331.
It is not an unprimeable number, because it can be changed into a prime (3220100311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 731146 + ... + 735536.
It is an arithmetic number, because the mean of its divisors is an integer number (156847104).
Almost surely, 23220100331 is an apocalyptic number.
3220100331 is a deficient number, since it is larger than the sum of its proper divisors (1799006997).
3220100331 is a wasteful number, since it uses less digits than its factorization.
3220100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5191.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3220100331 is about 56745.9278803334. The cubic root of 3220100331 is about 1476.6915888755.
Adding to 3220100331 its reverse (1330010223), we get a palindrome (4550110554).
The spelling of 3220100331 in words is "three billion, two hundred twenty million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •