Base | Representation |
---|---|
bin | 1011001111000010111111… |
… | …1111011101000001111111 |
3 | 1121201221120221112222201021 |
4 | 2303300233333131001333 |
5 | 3104343203030401211 |
6 | 42134541115125011 |
7 | 2413325050622653 |
oct | 263605777350177 |
9 | 47657527488637 |
10 | 12353131106431 |
11 | 3a32a2a511815 |
12 | 1476152743767 |
13 | 6b7b83b879bb |
14 | 309c75224a63 |
15 | 1664eecb4771 |
hex | b3c2ffdd07f |
12353131106431 has 2 divisors, whose sum is σ = 12353131106432. Its totient is φ = 12353131106430.
The previous prime is 12353131106413. The next prime is 12353131106497. The reversal of 12353131106431 is 13460113135321.
Together with previous prime (12353131106413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12353131106431 - 241 = 10154107850879 is a prime.
It is a super-2 number, since 2×123531311064312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12353131106131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6176565553215 + 6176565553216.
It is an arithmetic number, because the mean of its divisors is an integer number (6176565553216).
Almost surely, 212353131106431 is an apocalyptic number.
12353131106431 is a deficient number, since it is larger than the sum of its proper divisors (1).
12353131106431 is an equidigital number, since it uses as much as digits as its factorization.
12353131106431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 34.
The spelling of 12353131106431 in words is "twelve trillion, three hundred fifty-three billion, one hundred thirty-one million, one hundred six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •