Base | Representation |
---|---|
bin | 10011000110000110011… |
… | …010100001001010110111 |
3 | 11122110001212200001201002 |
4 | 103012012122201022313 |
5 | 132444411322430311 |
6 | 2442454155153515 |
7 | 163543016005511 |
oct | 23060632411267 |
9 | 4573055601632 |
10 | 1312220123831 |
11 | 466567061091 |
12 | 192397a4589b |
13 | 96984a40b46 |
14 | 47724506bb1 |
15 | 24201b7793b |
hex | 131866a12b7 |
1312220123831 has 2 divisors, whose sum is σ = 1312220123832. Its totient is φ = 1312220123830.
The previous prime is 1312220123827. The next prime is 1312220123843. The reversal of 1312220123831 is 1383210222131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1312220123831 - 22 = 1312220123827 is a prime.
It is a super-2 number, since 2×13122201238312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1312220123794 and 1312220123803.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312220143831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656110061915 + 656110061916.
It is an arithmetic number, because the mean of its divisors is an integer number (656110061916).
Almost surely, 21312220123831 is an apocalyptic number.
1312220123831 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312220123831 is an equidigital number, since it uses as much as digits as its factorization.
1312220123831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 1312220123831 its reverse (1383210222131), we get a palindrome (2695430345962).
The spelling of 1312220123831 in words is "one trillion, three hundred twelve billion, two hundred twenty million, one hundred twenty-three thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •