Base | Representation |
---|---|
bin | 10011010101110101010101… |
… | …01101111001000110001101 |
3 | 12120120222120110000102022202 |
4 | 21222322222231321012031 |
5 | 21033314234330301221 |
6 | 230242432232051245 |
7 | 11646544306526516 |
oct | 1152725255710615 |
9 | 176528513012282 |
10 | 42531630322061 |
11 | 12608621579491 |
12 | 492aab8b33b25 |
13 | 1a9693c0331aa |
14 | a70782d41a0d |
15 | 4db52a644d0b |
hex | 26aeaab7918d |
42531630322061 has 2 divisors, whose sum is σ = 42531630322062. Its totient is φ = 42531630322060.
The previous prime is 42531630322057. The next prime is 42531630322063. The reversal of 42531630322061 is 16022303613524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42107185890025 + 424444432036 = 6489005^2 + 651494^2 .
It is a cyclic number.
It is not a de Polignac number, because 42531630322061 - 22 = 42531630322057 is a prime.
Together with 42531630322063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42531630322063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21265815161030 + 21265815161031.
It is an arithmetic number, because the mean of its divisors is an integer number (21265815161031).
Almost surely, 242531630322061 is an apocalyptic number.
It is an amenable number.
42531630322061 is a deficient number, since it is larger than the sum of its proper divisors (1).
42531630322061 is an equidigital number, since it uses as much as digits as its factorization.
42531630322061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 38.
Adding to 42531630322061 its reverse (16022303613524), we get a palindrome (58553933935585).
The spelling of 42531630322061 in words is "forty-two trillion, five hundred thirty-one billion, six hundred thirty million, three hundred twenty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •