Base | Representation |
---|---|
bin | 110000010100010010100… |
… | …0111101111000100100101 |
3 | 212111211122202220112011121 |
4 | 1200220211013233010211 |
5 | 1332300013402140141 |
6 | 22042400253133541 |
7 | 1253525206400332 |
oct | 140504507570445 |
9 | 25454582815147 |
10 | 6640642224421 |
11 | 213030a461777 |
12 | 8b300178a2b1 |
13 | 3922961305ba |
14 | 18d5a1a59989 |
15 | b7b11d9b1d1 |
hex | 60a251ef125 |
6640642224421 has 8 divisors (see below), whose sum is σ = 6645494358144. Its totient is φ = 6635791868160.
The previous prime is 6640642224413. The next prime is 6640642224487. The reversal of 6640642224421 is 1244222460466.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6640642224421 - 23 = 6640642224413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6640672224421) 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 in 7 ways as a sum of consecutive naturals, for example, 7076820 + ... + 7960066.
It is an arithmetic number, because the mean of its divisors is an integer number (830686794768).
Almost surely, 26640642224421 is an apocalyptic number.
It is an amenable number.
6640642224421 is a deficient number, since it is larger than the sum of its proper divisors (4852133723).
6640642224421 is a wasteful number, since it uses less digits than its factorization.
6640642224421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888731.
The product of its (nonzero) digits is 884736, while the sum is 43.
Adding to 6640642224421 its reverse (1244222460466), we get a palindrome (7884864684887).
The spelling of 6640642224421 in words is "six trillion, six hundred forty billion, six hundred forty-two million, two hundred twenty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •