Base | Representation |
---|---|
bin | 101111010101111000101… |
… | …1000100010001001101101 |
3 | 212001000202020200200002201 |
4 | 1132223301120202021231 |
5 | 1323101034314222131 |
6 | 21501034335021501 |
7 | 1241042235246214 |
oct | 136536130421155 |
9 | 25030666620081 |
10 | 6506630226541 |
11 | 20894a0154215 |
12 | 89104136a891 |
13 | 382759cc6333 |
14 | 186ccb7d607b |
15 | b43bbbe2761 |
hex | 5eaf162226d |
6506630226541 has 2 divisors, whose sum is σ = 6506630226542. Its totient is φ = 6506630226540.
The previous prime is 6506630226451. The next prime is 6506630226553. The reversal of 6506630226541 is 1456220366056.
Together with previous prime (6506630226451) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5710885944516 + 795744282025 = 2389746^2 + 892045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6506630226541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6506630226491 and 6506630226500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6506630226841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3253315113270 + 3253315113271.
It is an arithmetic number, because the mean of its divisors is an integer number (3253315113271).
Almost surely, 26506630226541 is an apocalyptic number.
It is an amenable number.
6506630226541 is a deficient number, since it is larger than the sum of its proper divisors (1).
6506630226541 is an equidigital number, since it uses as much as digits as its factorization.
6506630226541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 6506630226541 in words is "six trillion, five hundred six billion, six hundred thirty million, two hundred twenty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •