Base | Representation |
---|---|
bin | 110000001100101000101… |
… | …010110111011110000111 |
3 | 102201122010002110020122200 |
4 | 300030220222313132013 |
5 | 413231141120023421 |
6 | 11013320402525543 |
7 | 461201656300263 |
oct | 60145052673607 |
9 | 12648102406580 |
10 | 3312102111111 |
11 | 10677223281a2 |
12 | 455aa83668b3 |
13 | 1b04399c59b1 |
14 | b64414370a3 |
15 | 5b24e5e3726 |
hex | 30328ab7787 |
3312102111111 has 12 divisors (see below), whose sum is σ = 4784187376488. Its totient is φ = 2208049666704.
The previous prime is 3312102111061. The next prime is 3312102111119. The reversal of 3312102111111 is 1111112012133.
3312102111111 is a `hidden beast` number, since 331 + 2 + 10 + 211 + 1 + 111 = 666.
3312102111111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3312102111111 - 213 = 3312102102919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3312102111119) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 345945 + ... + 2596898.
It is an arithmetic number, because the mean of its divisors is an integer number (398682281374).
Almost surely, 23312102111111 is an apocalyptic number.
3312102111111 is a deficient number, since it is larger than the sum of its proper divisors (1472085265377).
3312102111111 is a wasteful number, since it uses less digits than its factorization.
3312102111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3067902 (or 3067899 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 3312102111111 its reverse (1111112012133), we get a palindrome (4423214123244).
The spelling of 3312102111111 in words is "three trillion, three hundred twelve billion, one hundred two million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •