Base | Representation |
---|---|
bin | 10011000110000001001… |
… | …010010111001000011011 |
3 | 11122102211201212000201211 |
4 | 103012001022113020123 |
5 | 132444221243033311 |
6 | 2442441330323551 |
7 | 163540565665513 |
oct | 23060112271033 |
9 | 4572751760654 |
10 | 1312132002331 |
11 | 4665213430a7 |
12 | 1923724295b7 |
13 | 9696c6c8c47 |
14 | 47716928843 |
15 | 241e906c821 |
hex | 1318129721b |
1312132002331 has 2 divisors, whose sum is σ = 1312132002332. Its totient is φ = 1312132002330.
The previous prime is 1312132002169. The next prime is 1312132002353. The reversal of 1312132002331 is 1332002312131.
It is an a-pointer prime, because the next prime (1312132002353) can be obtained adding 1312132002331 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1312132002331 - 29 = 1312132001819 is a prime.
It is a super-2 number, since 2×13121320023312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1312132000331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656066001165 + 656066001166.
It is an arithmetic number, because the mean of its divisors is an integer number (656066001166).
Almost surely, 21312132002331 is an apocalyptic number.
1312132002331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312132002331 is an equidigital number, since it uses as much as digits as its factorization.
1312132002331 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 22.
Adding to 1312132002331 its reverse (1332002312131), we get a palindrome (2644134314462).
The spelling of 1312132002331 in words is "one trillion, three hundred twelve billion, one hundred thirty-two million, two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •