Base | Representation |
---|---|
bin | 101111111010010100100011… |
… | …0111101101100010101110101 |
3 | 2001021011111120200220202102011 |
4 | 1133310221012331230111311 |
5 | 420214220134212030022 |
6 | 4052151101450044221 |
7 | 154524312060463342 |
oct | 13764510675542565 |
9 | 2037144520822364 |
10 | 421431971595637 |
11 | 112310328290a32 |
12 | 3b32440a719671 |
13 | 1511cb31111182 |
14 | 760d5b82dd7c9 |
15 | 33ac62cd9e977 |
hex | 17f4a46f6c575 |
421431971595637 has 2 divisors, whose sum is σ = 421431971595638. Its totient is φ = 421431971595636.
The previous prime is 421431971595629. The next prime is 421431971595643. The reversal of 421431971595637 is 736595179134124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 420648040206436 + 783931389201 = 20509706^2 + 885399^2 .
It is a cyclic number.
It is not a de Polignac number, because 421431971595637 - 23 = 421431971595629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421431971595737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210715985797818 + 210715985797819.
It is an arithmetic number, because the mean of its divisors is an integer number (210715985797819).
Almost surely, 2421431971595637 is an apocalyptic number.
It is an amenable number.
421431971595637 is a deficient number, since it is larger than the sum of its proper divisors (1).
421431971595637 is an equidigital number, since it uses as much as digits as its factorization.
421431971595637 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 171460800, while the sum is 67.
The spelling of 421431971595637 in words is "four hundred twenty-one trillion, four hundred thirty-one billion, nine hundred seventy-one million, five hundred ninety-five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •