Base | Representation |
---|---|
bin | 10100110101000000101… |
… | …111010001011100000111 |
3 | 12001211110110201222011101 |
4 | 110311000233101130013 |
5 | 141422310410243331 |
6 | 3013311305520531 |
7 | 205260126222034 |
oct | 24650057213407 |
9 | 5054413658141 |
10 | 1431310243591 |
11 | 502019355768 |
12 | 1b1492aa3147 |
13 | a4c83582627 |
14 | 4d3c0a8038b |
15 | 27371cee061 |
hex | 14d40bd1707 |
1431310243591 has 2 divisors, whose sum is σ = 1431310243592. Its totient is φ = 1431310243590.
The previous prime is 1431310243523. The next prime is 1431310243631. The reversal of 1431310243591 is 1953420131341.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1431310243591 - 227 = 1431176025863 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1431310243591.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1431310243091) 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, 715655121795 + 715655121796.
It is an arithmetic number, because the mean of its divisors is an integer number (715655121796).
Almost surely, 21431310243591 is an apocalyptic number.
1431310243591 is a deficient number, since it is larger than the sum of its proper divisors (1).
1431310243591 is an equidigital number, since it uses as much as digits as its factorization.
1431310243591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 1431310243591 in words is "one trillion, four hundred thirty-one billion, three hundred ten million, two hundred forty-three thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •