Base | Representation |
---|---|
bin | 100011011000101011011011… |
… | …1010100011001100110110001 |
3 | 1111211001200201100000210201211 |
4 | 1012301112313110121212301 |
5 | 311244100331000131423 |
6 | 3021552333440400121 |
7 | 122363302362614416 |
oct | 10661266724314661 |
9 | 1454050640023654 |
10 | 311255060552113 |
11 | 901a2591308357 |
12 | 2aaab396016041 |
13 | 1048a2c3157992 |
14 | 56c0b7a92410d |
15 | 25eb6d224a10d |
hex | 11b15b75199b1 |
311255060552113 has 2 divisors, whose sum is σ = 311255060552114. Its totient is φ = 311255060552112.
The previous prime is 311255060552071. The next prime is 311255060552159.
311255060552113 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 307045435834944 + 4209624717169 = 17522712^2 + 2051737^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 311255060552113 - 229 = 311254523681201 is a prime.
It is a super-3 number, since 3×3112550605521133 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (311255060552213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155627530276056 + 155627530276057.
It is an arithmetic number, because the mean of its divisors is an integer number (155627530276057).
Almost surely, 2311255060552113 is an apocalyptic number.
It is an amenable number.
311255060552113 is a deficient number, since it is larger than the sum of its proper divisors (1).
311255060552113 is an equidigital number, since it uses as much as digits as its factorization.
311255060552113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 311255060552113 in words is "three hundred eleven trillion, two hundred fifty-five billion, sixty million, five hundred fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •