Base | Representation |
---|---|
bin | 10111010111111100101… |
… | …001111101000000001101 |
3 | 12200120001010200122102012 |
4 | 113113330221331000031 |
5 | 202304110441020423 |
6 | 3225523441511005 |
7 | 224022442546424 |
oct | 27277451750015 |
9 | 5616033618365 |
10 | 1606261657613 |
11 | 56a236915538 |
12 | 21b379942465 |
13 | b86152866a2 |
14 | 57a5a16c2bb |
15 | 2bbb11a5078 |
hex | 175fca7d00d |
1606261657613 has 2 divisors, whose sum is σ = 1606261657614. Its totient is φ = 1606261657612.
The previous prime is 1606261657607. The next prime is 1606261657631. The reversal of 1606261657613 is 3167561626061.
Together with next prime (1606261657631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1601991427204 + 4270230409 = 1265698^2 + 65347^2 .
It is a cyclic number.
It is not a de Polignac number, because 1606261657613 - 212 = 1606261653517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1606261657643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 803130828806 + 803130828807.
It is an arithmetic number, because the mean of its divisors is an integer number (803130828807).
Almost surely, 21606261657613 is an apocalyptic number.
It is an amenable number.
1606261657613 is a deficient number, since it is larger than the sum of its proper divisors (1).
1606261657613 is an equidigital number, since it uses as much as digits as its factorization.
1606261657613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 50.
The spelling of 1606261657613 in words is "one trillion, six hundred six billion, two hundred sixty-one million, six hundred fifty-seven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •