Base | Representation |
---|---|
bin | 110000011011101100000… |
… | …1100101001010100100101 |
3 | 212120100200010110010211020 |
4 | 1200313120030221110211 |
5 | 1333030034033111031 |
6 | 22053545100201353 |
7 | 1254630025325355 |
oct | 140673014512445 |
9 | 25510603403736 |
10 | 6656531535141 |
11 | 2137023575024 |
12 | 8b60b6b39259 |
13 | 393928c9c7c7 |
14 | 19026c016b65 |
15 | b8241cca096 |
hex | 60dd8329525 |
6656531535141 has 4 divisors (see below), whose sum is σ = 8875375380192. Its totient is φ = 4437687690092.
The previous prime is 6656531535127. The next prime is 6656531535161. The reversal of 6656531535141 is 1415351356566.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6656531535141 - 219 = 6656531010853 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6656531535161) 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 3 ways as a sum of consecutive naturals, for example, 1109421922521 + ... + 1109421922526.
It is an arithmetic number, because the mean of its divisors is an integer number (2218843845048).
Almost surely, 26656531535141 is an apocalyptic number.
It is an amenable number.
6656531535141 is a deficient number, since it is larger than the sum of its proper divisors (2218843845051).
6656531535141 is a wasteful number, since it uses less digits than its factorization.
6656531535141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2218843845050.
The product of its digits is 4860000, while the sum is 51.
The spelling of 6656531535141 in words is "six trillion, six hundred fifty-six billion, five hundred thirty-one million, five hundred thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •