Base | Representation |
---|---|
bin | 1001001001001101010001100… |
… | …1100100010000100100100101 |
3 | 10010101020111012200211221010102 |
4 | 2102103110121210100210211 |
5 | 1133314124430244413414 |
6 | 10200253201433433445 |
7 | 252350114423350256 |
oct | 22223243144204445 |
9 | 3111214180757112 |
10 | 643442364451109 |
11 | 177025413252253 |
12 | 601bb535b6b885 |
13 | 2180547c114c62 |
14 | b4c6ac3018b2d |
15 | 4e5c62c3b1ede |
hex | 2493519910925 |
643442364451109 has 2 divisors, whose sum is σ = 643442364451110. Its totient is φ = 643442364451108.
The previous prime is 643442364450989. The next prime is 643442364451157. The reversal of 643442364451109 is 901154463244346.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 511319638814884 + 132122725636225 = 22612378^2 + 11494465^2 .
It is a cyclic number.
It is not a de Polignac number, because 643442364451109 - 220 = 643442363402533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (643442334451109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 321721182225554 + 321721182225555.
It is an arithmetic number, because the mean of its divisors is an integer number (321721182225555).
Almost surely, 2643442364451109 is an apocalyptic number.
It is an amenable number.
643442364451109 is a deficient number, since it is larger than the sum of its proper divisors (1).
643442364451109 is an equidigital number, since it uses as much as digits as its factorization.
643442364451109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29859840, while the sum is 56.
The spelling of 643442364451109 in words is "six hundred forty-three trillion, four hundred forty-two billion, three hundred sixty-four million, four hundred fifty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •