Base | Representation |
---|---|
bin | 110000001011110100110… |
… | …000101011101001010111 |
3 | 102201112212101201102001212 |
4 | 300023310300223221113 |
5 | 413222400143022221 |
6 | 11013054132412035 |
7 | 461141252660120 |
oct | 60136460535127 |
9 | 12645771642055 |
10 | 3311231220311 |
11 | 1067315778033 |
12 | 4558a477701b |
13 | 1b032b4519b1 |
14 | b639b8d7047 |
15 | 5b1ece16b5b |
hex | 302f4c2ba57 |
3311231220311 has 8 divisors (see below), whose sum is σ = 3837563748864. Its totient is φ = 2798223566040.
The previous prime is 3311231220293. The next prime is 3311231220317. The reversal of 3311231220311 is 1130221321133.
3311231220311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3311231220311 - 222 = 3311227026007 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 (3311231220317) 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, 3331218035 + ... + 3331219028.
It is an arithmetic number, because the mean of its divisors is an integer number (479695468608).
Almost surely, 23311231220311 is an apocalyptic number.
3311231220311 is a deficient number, since it is larger than the sum of its proper divisors (526332528553).
3311231220311 is an equidigital number, since it uses as much as digits as its factorization.
3311231220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6662437141.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3311231220311 its reverse (1130221321133), we get a palindrome (4441452541444).
The spelling of 3311231220311 in words is "three trillion, three hundred eleven billion, two hundred thirty-one million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •