Base | Representation |
---|---|
bin | 110000011111100100110000… |
… | …1111111010010101100000101 |
3 | 2001221021222100002121100201221 |
4 | 1200333021201333102230011 |
5 | 421402112022130012032 |
6 | 4111111143501320341 |
7 | 155563236563130412 |
oct | 14077114177225405 |
9 | 2057258302540657 |
10 | 426552026016517 |
11 | 113a04775552845 |
12 | 3ba107825660b1 |
13 | 154018b67351ab |
14 | 774932a317109 |
15 | 344a8e5226597 |
hex | 183f261fd2b05 |
426552026016517 has 2 divisors, whose sum is σ = 426552026016518. Its totient is φ = 426552026016516.
The previous prime is 426552026016499. The next prime is 426552026016583. The reversal of 426552026016517 is 715610620255624.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 399216424120801 + 27335601895716 = 19980401^2 + 5228346^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-426552026016517 is a prime.
It is a super-2 number, since 2×4265520260165172 (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 (426552026016617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 213276013008258 + 213276013008259.
It is an arithmetic number, because the mean of its divisors is an integer number (213276013008259).
Almost surely, 2426552026016517 is an apocalyptic number.
It is an amenable number.
426552026016517 is a deficient number, since it is larger than the sum of its proper divisors (1).
426552026016517 is an equidigital number, since it uses as much as digits as its factorization.
426552026016517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048000, while the sum is 52.
The spelling of 426552026016517 in words is "four hundred twenty-six trillion, five hundred fifty-two billion, twenty-six million, sixteen thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •