Base | Representation |
---|---|
bin | 110000100000011010000110… |
… | …1000001011100010110110001 |
3 | 2001221200220222111012222220001 |
4 | 1201000310031001130112301 |
5 | 421411001111021242113 |
6 | 4111235525221350001 |
7 | 155604433135251043 |
oct | 14100641501342661 |
9 | 2057626874188801 |
10 | 426666564634033 |
11 | 113a4930161a419 |
12 | 3ba2aa09268301 |
13 | 1540c63b30a099 |
14 | 7750ab41b9a93 |
15 | 344d89a9d97dd |
hex | 1840d0d05c5b1 |
426666564634033 has 2 divisors, whose sum is σ = 426666564634034. Its totient is φ = 426666564634032.
The previous prime is 426666564634001. The next prime is 426666564634061. The reversal of 426666564634033 is 330436465666624.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 321802267567104 + 104864297066929 = 17938848^2 + 10240327^2 .
It is a cyclic number.
It is not a de Polignac number, because 426666564634033 - 25 = 426666564634001 is a prime.
It is not a weakly prime, because it can be changed into another prime (426666564664033) 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, 213333282317016 + 213333282317017.
It is an arithmetic number, because the mean of its divisors is an integer number (213333282317017).
Almost surely, 2426666564634033 is an apocalyptic number.
It is an amenable number.
426666564634033 is a deficient number, since it is larger than the sum of its proper divisors (1).
426666564634033 is an equidigital number, since it uses as much as digits as its factorization.
426666564634033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806215680, while the sum is 64.
The spelling of 426666564634033 in words is "four hundred twenty-six trillion, six hundred sixty-six billion, five hundred sixty-four million, six hundred thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •