Base | Representation |
---|---|
bin | 10100110101000000101… |
… | …111010001011100101111 |
3 | 12001211110110201222012212 |
4 | 110311000233101130233 |
5 | 141422310410244011 |
6 | 3013311305521035 |
7 | 205260126222122 |
oct | 24650057213457 |
9 | 5054413658185 |
10 | 1431310243631 |
11 | 5020193557a4 |
12 | 1b1492aa317b |
13 | a4c83582658 |
14 | 4d3c0a803b9 |
15 | 27371cee08b |
hex | 14d40bd172f |
1431310243631 has 2 divisors, whose sum is σ = 1431310243632. Its totient is φ = 1431310243630.
The previous prime is 1431310243591. The next prime is 1431310243639. The reversal of 1431310243631 is 1363420131341.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1431310243631 - 214 = 1431310227247 is a prime.
It is a super-2 number, since 2×14313102436312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1431310243639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 715655121815 + 715655121816.
It is an arithmetic number, because the mean of its divisors is an integer number (715655121816).
Almost surely, 21431310243631 is an apocalyptic number.
1431310243631 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431310243631 is an equidigital number, since it uses as much as digits as its factorization.
1431310243631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 1431310243631 its reverse (1363420131341), we get a palindrome (2794730374972).
The spelling of 1431310243631 in words is "one trillion, four hundred thirty-one billion, three hundred ten million, two hundred forty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •