Base | Representation |
---|---|
bin | 100101101001111001001011… |
… | …0011101000100011111110011 |
3 | 1121102201200012221020212201002 |
4 | 1023103302112131010133303 |
5 | 321403044134340420311 |
6 | 3132233130445432215 |
7 | 126523236260552261 |
oct | 11323622635043763 |
9 | 1542650187225632 |
10 | 331213222201331 |
11 | 96597814249188 |
12 | 31193411b6b66b |
13 | 112a737155c122 |
14 | 5bb0b3c397431 |
15 | 284593901793b |
hex | 12d3c967447f3 |
331213222201331 has 2 divisors, whose sum is σ = 331213222201332. Its totient is φ = 331213222201330.
The previous prime is 331213222201289. The next prime is 331213222201399. The reversal of 331213222201331 is 133102222312133.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 331213222201331 - 238 = 330938344294387 is a prime.
It is a super-2 number, since 2×3312132222013312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 331213222201294 and 331213222201303.
It is not a weakly prime, because it can be changed into another prime (331213222201931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165606611100665 + 165606611100666.
It is an arithmetic number, because the mean of its divisors is an integer number (165606611100666).
Almost surely, 2331213222201331 is an apocalyptic number.
331213222201331 is a deficient number, since it is larger than the sum of its proper divisors (1).
331213222201331 is an equidigital number, since it uses as much as digits as its factorization.
331213222201331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 331213222201331 its reverse (133102222312133), we get a palindrome (464315444513464).
The spelling of 331213222201331 in words is "three hundred thirty-one trillion, two hundred thirteen billion, two hundred twenty-two million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •