Base | Representation |
---|---|
bin | 1110010010110001011001… |
… | …10111011110101110100001 |
3 | 11010021210201222012211020112 |
4 | 13021120230313132232201 |
5 | 13104432322243212114 |
6 | 150503203423221105 |
7 | 6422560331562233 |
oct | 711305467365641 |
9 | 133253658184215 |
10 | 31431323413409 |
11 | a018a49721467 |
12 | 3637726747795 |
13 | 146cc6565316a |
14 | 7a93d9a98253 |
15 | 397902d2a13e |
hex | 1c962cddeba1 |
31431323413409 has 2 divisors, whose sum is σ = 31431323413410. Its totient is φ = 31431323413408.
The previous prime is 31431323413379. The next prime is 31431323413411. The reversal of 31431323413409 is 90431432313413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26523118003600 + 4908205409809 = 5150060^2 + 2215447^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31431323413409 is a prime.
It is a super-2 number, since 2×314313234134092 (a number of 28 digits) contains 22 as substring.
Together with 31431323413411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (31431323413429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15715661706704 + 15715661706705.
It is an arithmetic number, because the mean of its divisors is an integer number (15715661706705).
Almost surely, 231431323413409 is an apocalyptic number.
It is an amenable number.
31431323413409 is a deficient number, since it is larger than the sum of its proper divisors (1).
31431323413409 is an equidigital number, since it uses as much as digits as its factorization.
31431323413409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 31431323413409 in words is "thirty-one trillion, four hundred thirty-one billion, three hundred twenty-three million, four hundred thirteen thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •