Base | Representation |
---|---|
bin | 100011011000010111011110… |
… | …1111101000110100000010001 |
3 | 1111210220121010212010122201122 |
4 | 1012300232331331012200101 |
5 | 311242400112341241423 |
6 | 3021520530550212025 |
7 | 122360224662003035 |
oct | 10660567575064021 |
9 | 1453817125118648 |
10 | 311212222212113 |
11 | 901863a9175482 |
12 | 2aaa301b654015 |
13 | 104862570430c1 |
14 | 56bca753d21c5 |
15 | 25ea5264a38c8 |
hex | 11b0bbdf46811 |
311212222212113 has 4 divisors (see below), whose sum is σ = 314293531343028. Its totient is φ = 308130913081200.
The previous prime is 311212222212053. The next prime is 311212222212161.
311212222212113 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 223802288160529 + 87409934051584 = 14960023^2 + 9349328^2 .
It is a cyclic number.
It is not a de Polignac number, because 311212222212113 - 26 = 311212222212049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311212222212163) 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, 1540654565306 + ... + 1540654565507.
It is an arithmetic number, because the mean of its divisors is an integer number (78573382835757).
Almost surely, 2311212222212113 is an apocalyptic number.
It is an amenable number.
311212222212113 is a deficient number, since it is larger than the sum of its proper divisors (3081309130915).
311212222212113 is a wasteful number, since it uses less digits than its factorization.
311212222212113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3081309130914.
The product of its digits is 1152, while the sum is 26.
The spelling of 311212222212113 in words is "three hundred eleven trillion, two hundred twelve billion, two hundred twenty-two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •