Base | Representation |
---|---|
bin | 11110000010101001000… |
… | …111100011111000111101 |
3 | 21022100122002111220201121 |
4 | 132002221013203320331 |
5 | 232310413414233342 |
6 | 4220214320110541 |
7 | 302102202232561 |
oct | 36025107437075 |
9 | 7270562456647 |
10 | 2064421633597 |
11 | 726575213694 |
12 | 294122765451 |
13 | 11c89c08a3ab |
14 | 71cc068d6a1 |
15 | 38a789de067 |
hex | 1e0a91e3e3d |
2064421633597 has 2 divisors, whose sum is σ = 2064421633598. Its totient is φ = 2064421633596.
The previous prime is 2064421633579. The next prime is 2064421633609. The reversal of 2064421633597 is 7953361244602.
Together with previous prime (2064421633579) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1447271556676 + 617150076921 = 1203026^2 + 785589^2 .
It is a cyclic number.
It is not a de Polignac number, because 2064421633597 - 235 = 2030061895229 is a prime.
It is a super-2 number, since 2×20644216335972 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2064421633507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1032210816798 + 1032210816799.
It is an arithmetic number, because the mean of its divisors is an integer number (1032210816799).
Almost surely, 22064421633597 is an apocalyptic number.
It is an amenable number.
2064421633597 is a deficient number, since it is larger than the sum of its proper divisors (1).
2064421633597 is an equidigital number, since it uses as much as digits as its factorization.
2064421633597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6531840, while the sum is 52.
The spelling of 2064421633597 in words is "two trillion, sixty-four billion, four hundred twenty-one million, six hundred thirty-three thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •