Base | Representation |
---|---|
bin | 1001011100100010101101110… |
… | …1110011111101101010100101 |
3 | 10020011111211121220222222021222 |
4 | 2113020223131303331222211 |
5 | 1144110432032203101323 |
6 | 10313411344113550125 |
7 | 260003044403405132 |
oct | 22710533563755245 |
9 | 3204454556888258 |
10 | 664701450050213 |
11 | 182881335905514 |
12 | 62673716875345 |
13 | 226b8101b74444 |
14 | ba1da16a29589 |
15 | 51ca6242629c8 |
hex | 25c8addcfdaa5 |
664701450050213 has 2 divisors, whose sum is σ = 664701450050214. Its totient is φ = 664701450050212.
The previous prime is 664701450050177. The next prime is 664701450050227. The reversal of 664701450050213 is 312050054107466.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 406197340218244 + 258504109831969 = 20154338^2 + 16078063^2 .
It is a cyclic number.
It is not a de Polignac number, because 664701450050213 - 244 = 647109264005797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (664701450050293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 332350725025106 + 332350725025107.
It is an arithmetic number, because the mean of its divisors is an integer number (332350725025107).
Almost surely, 2664701450050213 is an apocalyptic number.
It is an amenable number.
664701450050213 is a deficient number, since it is larger than the sum of its proper divisors (1).
664701450050213 is an equidigital number, since it uses as much as digits as its factorization.
664701450050213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 604800, while the sum is 44.
The spelling of 664701450050213 in words is "six hundred sixty-four trillion, seven hundred one billion, four hundred fifty million, fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •