Base | Representation |
---|---|
bin | 10010101100000001101… |
… | …11111001100010001011 |
3 | 2021101101220111201220222 |
4 | 21112000313321202023 |
5 | 41010021214424311 |
6 | 1210552102140255 |
7 | 64251066122606 |
oct | 11260067714213 |
9 | 2241356451828 |
10 | 642112264331 |
11 | 2283556a703a |
12 | a454212168b |
13 | 48721503005 |
14 | 231151b133d |
15 | 11a81ee0adb |
hex | 9580df988b |
642112264331 has 2 divisors, whose sum is σ = 642112264332. Its totient is φ = 642112264330.
The previous prime is 642112264247. The next prime is 642112264333. The reversal of 642112264331 is 133462211246.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 642112264331 - 234 = 624932395147 is a prime.
It is a super-2 number, since 2×6421122643312 (a number of 24 digits) contains 22 as substring.
Together with 642112264333, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 642112264291 and 642112264300.
It is not a weakly prime, because it can be changed into another prime (642112264333) 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, 321056132165 + 321056132166.
It is an arithmetic number, because the mean of its divisors is an integer number (321056132166).
Almost surely, 2642112264331 is an apocalyptic number.
642112264331 is a deficient number, since it is larger than the sum of its proper divisors (1).
642112264331 is an equidigital number, since it uses as much as digits as its factorization.
642112264331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 35.
Adding to 642112264331 its reverse (133462211246), we get a palindrome (775574475577).
The spelling of 642112264331 in words is "six hundred forty-two billion, one hundred twelve million, two hundred sixty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •