Base | Representation |
---|---|
bin | 10010101000010010011… |
… | …10111001001001011011 |
3 | 2021012020000112110202201 |
4 | 21110021032321021123 |
5 | 40441413341314024 |
6 | 1210021000111031 |
7 | 64150253643325 |
oct | 11241116711133 |
9 | 2235200473681 |
10 | 640105026139 |
11 | 2275156662a7 |
12 | a4081a65477 |
13 | 484916c31c7 |
14 | 22da4790615 |
15 | 119b5b9d744 |
hex | 95093b925b |
640105026139 has 2 divisors, whose sum is σ = 640105026140. Its totient is φ = 640105026138.
The previous prime is 640105026109. The next prime is 640105026149. The reversal of 640105026139 is 931620501046.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 640105026139 - 225 = 640071471707 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640105026098 and 640105026107.
It is not a weakly prime, because it can be changed into another prime (640105026109) 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, 320052513069 + 320052513070.
It is an arithmetic number, because the mean of its divisors is an integer number (320052513070).
Almost surely, 2640105026139 is an apocalyptic number.
640105026139 is a deficient number, since it is larger than the sum of its proper divisors (1).
640105026139 is an equidigital number, since it uses as much as digits as its factorization.
640105026139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 640105026139 in words is "six hundred forty billion, one hundred five million, twenty-six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •