Base | Representation |
---|---|
bin | 101110110110111101100… |
… | …101001000101001111111 |
3 | 102101211200002012101102211 |
4 | 232312331211020221333 |
5 | 410224241422231221 |
6 | 10503144301001251 |
7 | 451434233006602 |
oct | 56667545105177 |
9 | 12354602171384 |
10 | 3220111133311 |
11 | 1031706872006 |
12 | 4400b4853227 |
13 | 1a4869567b57 |
14 | b1bd5d4c339 |
15 | 58b685876e1 |
hex | 2edbd948a7f |
3220111133311 has 4 divisors (see below), whose sum is σ = 3250205629992. Its totient is φ = 3190016636632.
The previous prime is 3220111133293. The next prime is 3220111133329. The reversal of 3220111133311 is 1133311110223.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (3220111133293) and next prime (3220111133329).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3220111133311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220111133341) 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, 15047248180 + ... + 15047248393.
It is an arithmetic number, because the mean of its divisors is an integer number (812551407498).
Almost surely, 23220111133311 is an apocalyptic number.
3220111133311 is a deficient number, since it is larger than the sum of its proper divisors (30094496681).
3220111133311 is a wasteful number, since it uses less digits than its factorization.
3220111133311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30094496680.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 3220111133311 its reverse (1133311110223), we get a palindrome (4353422243534).
The spelling of 3220111133311 in words is "three trillion, two hundred twenty billion, one hundred eleven million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •