Base | Representation |
---|---|
bin | 1100011001111011110… |
… | …11000001100000000001 |
3 | 1111202012102222020222001 |
4 | 12030331323001200001 |
5 | 23440420101120441 |
6 | 523451240144001 |
7 | 42536432463364 |
oct | 6147573014001 |
9 | 1452172866861 |
10 | 426240645121 |
11 | 154849806475 |
12 | 6a737168001 |
13 | 3126abca3a5 |
14 | 168b721a0db |
15 | b14a484731 |
hex | 633dec1801 |
426240645121 has 2 divisors, whose sum is σ = 426240645122. Its totient is φ = 426240645120.
The previous prime is 426240645049. The next prime is 426240645143. The reversal of 426240645121 is 121546042624.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 423072193600 + 3168451521 = 650440^2 + 56289^2 .
It is a cyclic number.
It is not a de Polignac number, because 426240645121 - 219 = 426240120833 is a prime.
It is a super-2 number, since 2×4262406451212 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (426240645191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 213120322560 + 213120322561.
It is an arithmetic number, because the mean of its divisors is an integer number (213120322561).
Almost surely, 2426240645121 is an apocalyptic number.
It is an amenable number.
426240645121 is a deficient number, since it is larger than the sum of its proper divisors (1).
426240645121 is an equidigital number, since it uses as much as digits as its factorization.
426240645121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 92160, while the sum is 37.
Adding to 426240645121 its reverse (121546042624), we get a palindrome (547786687745).
The spelling of 426240645121 in words is "four hundred twenty-six billion, two hundred forty million, six hundred forty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •