Base | Representation |
---|---|
bin | 10010011000000101110… |
… | …11011101000011101001 |
3 | 2020100210000001110112202 |
4 | 21030002323131003221 |
5 | 40321111242114312 |
6 | 1202022045145545 |
7 | 63421624525601 |
oct | 11140273350351 |
9 | 2210700043482 |
10 | 631409332457 |
11 | 22386311a9a2 |
12 | a245585b2b5 |
13 | 47706cbab27 |
14 | 227bb94dc01 |
15 | 116575819c2 |
hex | 9302edd0e9 |
631409332457 has 2 divisors, whose sum is σ = 631409332458. Its totient is φ = 631409332456.
The previous prime is 631409332381. The next prime is 631409332459. The reversal of 631409332457 is 754233904136.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 399551674201 + 231857658256 = 632101^2 + 481516^2 .
It is a cyclic number.
It is not a de Polignac number, because 631409332457 - 234 = 614229463273 is a prime.
It is a super-2 number, since 2×6314093324572 (a number of 24 digits) contains 22 as substring.
Together with 631409332459, 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 (631409332459) 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, 315704666228 + 315704666229.
It is an arithmetic number, because the mean of its divisors is an integer number (315704666229).
Almost surely, 2631409332457 is an apocalyptic number.
It is an amenable number.
631409332457 is a deficient number, since it is larger than the sum of its proper divisors (1).
631409332457 is an equidigital number, since it uses as much as digits as its factorization.
631409332457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 47.
The spelling of 631409332457 in words is "six hundred thirty-one billion, four hundred nine million, three hundred thirty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •