Base | Representation |
---|---|
bin | 1001001001011101100100010… |
… | …1000011010010100000001101 |
3 | 10010102020020200120122120020111 |
4 | 2102113121011003102200031 |
5 | 1133333221200310130023 |
6 | 10201025532114120021 |
7 | 252406253602631116 |
oct | 22227310503224015 |
9 | 3112206616576214 |
10 | 643722266880013 |
11 | 177123097937962 |
12 | 60245830880011 |
13 | 21825998295b59 |
14 | b4d6476d1720d |
15 | 4e64a6048000d |
hex | 24976450d280d |
643722266880013 has 2 divisors, whose sum is σ = 643722266880014. Its totient is φ = 643722266880012.
The previous prime is 643722266879971. The next prime is 643722266880019. The reversal of 643722266880013 is 310088662227346.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 373924132545924 + 269798134334089 = 19337118^2 + 16425533^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-643722266880013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 643722266880013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (643722266880019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 321861133440006 + 321861133440007.
It is an arithmetic number, because the mean of its divisors is an integer number (321861133440007).
Almost surely, 2643722266880013 is an apocalyptic number.
It is an amenable number.
643722266880013 is a deficient number, since it is larger than the sum of its proper divisors (1).
643722266880013 is an equidigital number, since it uses as much as digits as its factorization.
643722266880013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27869184, while the sum is 58.
The spelling of 643722266880013 in words is "six hundred forty-three trillion, seven hundred twenty-two billion, two hundred sixty-six million, eight hundred eighty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •