Base | Representation |
---|---|
bin | 110000011111011110011110… |
… | …1001111110000000000111101 |
3 | 2001221020200111011102222222021 |
4 | 1200332330331033300000331 |
5 | 421401401344304001221 |
6 | 4111101032040520141 |
7 | 155562251161446214 |
oct | 14076747517600075 |
9 | 2057220434388867 |
10 | 426538524672061 |
11 | 1139a9a7738292a |
12 | 3ba0a034a80051 |
13 | 1540054452a489 |
14 | 774880916607b |
15 | 344a3a4c93041 |
hex | 183ef3d3f003d |
426538524672061 has 2 divisors, whose sum is σ = 426538524672062. Its totient is φ = 426538524672060.
The previous prime is 426538524671999. The next prime is 426538524672103. The reversal of 426538524672061 is 160276425835624.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 297377436283225 + 129161088388836 = 17244635^2 + 11364906^2 .
It is a cyclic number.
It is not a de Polignac number, because 426538524672061 - 219 = 426538524147773 is a prime.
It is a super-2 number, since 2×4265385246720612 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (426538524672361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 213269262336030 + 213269262336031.
It is an arithmetic number, because the mean of its divisors is an integer number (213269262336031).
Almost surely, 2426538524672061 is an apocalyptic number.
It is an amenable number.
426538524672061 is a deficient number, since it is larger than the sum of its proper divisors (1).
426538524672061 is an equidigital number, since it uses as much as digits as its factorization.
426538524672061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116121600, while the sum is 61.
The spelling of 426538524672061 in words is "four hundred twenty-six trillion, five hundred thirty-eight billion, five hundred twenty-four million, six hundred seventy-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •