Base | Representation |
---|---|
bin | 1100000001010110110… |
… | …00010110100101001101 |
3 | 1110111010210101222211201 |
4 | 12000223120112211031 |
5 | 23231403413232103 |
6 | 513430004345501 |
7 | 41561426502205 |
oct | 6005330264515 |
9 | 1414123358751 |
10 | 413044664653 |
11 | 14a197a43a95 |
12 | 680739a5291 |
13 | 2cc4704ab1a |
14 | 15dc4837405 |
15 | ab26c1e51d |
hex | 602b61694d |
413044664653 has 2 divisors, whose sum is σ = 413044664654. Its totient is φ = 413044664652.
The previous prime is 413044664651. The next prime is 413044664687. The reversal of 413044664653 is 356466440314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 394066296009 + 18978368644 = 627747^2 + 137762^2 .
It is a cyclic number.
It is not a de Polignac number, because 413044664653 - 21 = 413044664651 is a prime.
It is a super-2 number, since 2×4130446646532 (a number of 24 digits) contains 22 as substring.
Together with 413044664651, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413044664651) 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, 206522332326 + 206522332327.
It is an arithmetic number, because the mean of its divisors is an integer number (206522332327).
Almost surely, 2413044664653 is an apocalyptic number.
It is an amenable number.
413044664653 is a deficient number, since it is larger than the sum of its proper divisors (1).
413044664653 is an equidigital number, since it uses as much as digits as its factorization.
413044664653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2488320, while the sum is 46.
The spelling of 413044664653 in words is "four hundred thirteen billion, forty-four million, six hundred sixty-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •