Base | Representation |
---|---|
bin | 1100010111111101… |
… | …01001001110010101 |
3 | 122010222202210212102 |
4 | 12023332221032111 |
5 | 102101204001401 |
6 | 3015115331445 |
7 | 323426104361 |
oct | 61376511625 |
9 | 18128683772 |
10 | 6643422101 |
11 | 28aa047398 |
12 | 1354a50b85 |
13 | 81b4889c4 |
14 | 47045a2a1 |
15 | 28d38156b |
hex | 18bfa9395 |
6643422101 has 2 divisors, whose sum is σ = 6643422102. Its totient is φ = 6643422100.
The previous prime is 6643422083. The next prime is 6643422103. The reversal of 6643422101 is 1012243466.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3623919601 + 3019502500 = 60199^2 + 54950^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6643422101 is a prime.
Together with 6643422103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6643422103) 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, 3321711050 + 3321711051.
It is an arithmetic number, because the mean of its divisors is an integer number (3321711051).
Almost surely, 26643422101 is an apocalyptic number.
It is an amenable number.
6643422101 is a deficient number, since it is larger than the sum of its proper divisors (1).
6643422101 is an equidigital number, since it uses as much as digits as its factorization.
6643422101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
The square root of 6643422101 is about 81507.1904864841. The cubic root of 6643422101 is about 1879.8821131942.
Adding to 6643422101 its reverse (1012243466), we get a palindrome (7655665567).
The spelling of 6643422101 in words is "six billion, six hundred forty-three million, four hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •