Base | Representation |
---|---|
bin | 1110010001111100101110… |
… | …01111100000000111011001 |
3 | 11010012002202002020110011122 |
4 | 13020332113033200013121 |
5 | 13104001413042340002 |
6 | 150442205310535025 |
7 | 6420536455024124 |
oct | 710762717400731 |
9 | 133162662213148 |
10 | 31403043324377 |
11 | a007a5730aa5a |
12 | 3632153807475 |
13 | 146a3a96b937a |
14 | 7a7cb5c393bb |
15 | 396cea1d96a2 |
hex | 1c8f973e01d9 |
31403043324377 has 2 divisors, whose sum is σ = 31403043324378. Its totient is φ = 31403043324376.
The previous prime is 31403043324371. The next prime is 31403043324431. The reversal of 31403043324377 is 77342334030413.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15724524053056 + 15678519271321 = 3965416^2 + 3959611^2 .
It is an emirp because it is prime and its reverse (77342334030413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31403043324377 - 216 = 31403043258841 is a prime.
It is a super-2 number, since 2×314030433243772 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31403043324371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15701521662188 + 15701521662189.
It is an arithmetic number, because the mean of its divisors is an integer number (15701521662189).
Almost surely, 231403043324377 is an apocalyptic number.
It is an amenable number.
31403043324377 is a deficient number, since it is larger than the sum of its proper divisors (1).
31403043324377 is an equidigital number, since it uses as much as digits as its factorization.
31403043324377 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1524096, while the sum is 44.
The spelling of 31403043324377 in words is "thirty-one trillion, four hundred three billion, forty-three million, three hundred twenty-four thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •