Base | Representation |
---|---|
bin | 101110100110001100110… |
… | …100100101100111001111 |
3 | 102100010012202222020022212 |
4 | 232212030310211213033 |
5 | 404430411441400221 |
6 | 10451010331301035 |
7 | 450226231243241 |
oct | 56461464454717 |
9 | 12303182866285 |
10 | 3202113231311 |
11 | 1025010492935 |
12 | 4387112aa77b |
13 | 1a2c5b8c04b7 |
14 | b0da990a091 |
15 | 58463495b5b |
hex | 2e98cd259cf |
3202113231311 has 2 divisors, whose sum is σ = 3202113231312. Its totient is φ = 3202113231310.
The previous prime is 3202113231277. The next prime is 3202113231313. The reversal of 3202113231311 is 1131323112023.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3202113231311 - 226 = 3202046122447 is a prime.
It is a super-2 number, since 2×32021132313112 (a number of 26 digits) contains 22 as substring.
Together with 3202113231313, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3202113231313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1601056615655 + 1601056615656.
It is an arithmetic number, because the mean of its divisors is an integer number (1601056615656).
Almost surely, 23202113231311 is an apocalyptic number.
3202113231311 is a deficient number, since it is larger than the sum of its proper divisors (1).
3202113231311 is an equidigital number, since it uses as much as digits as its factorization.
3202113231311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 3202113231311 its reverse (1131323112023), we get a palindrome (4333436343334).
The spelling of 3202113231311 in words is "three trillion, two hundred two billion, one hundred thirteen million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •