Base | Representation |
---|---|
bin | 11000001010101111110… |
… | …011100010000111001111 |
3 | 12212202211111011221212022 |
4 | 120022233303202013033 |
5 | 204202313031220002 |
6 | 3310544131400355 |
7 | 230663225465306 |
oct | 30125763420717 |
9 | 5782744157768 |
10 | 1660806898127 |
11 | 590387219003 |
12 | 229a60a530bb |
13 | c07c88acb30 |
14 | 5a5523c343d |
15 | 2d304ac2ba2 |
hex | 182afce21cf |
1660806898127 has 4 divisors (see below), whose sum is σ = 1788561274920. Its totient is φ = 1533052521336.
The previous prime is 1660806898117. The next prime is 1660806898147. The reversal of 1660806898127 is 7218986080661.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1660806898127 - 24 = 1660806898111 is a prime.
It is a super-2 number, since 2×16608068981272 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1660806898127.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1660806898117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63877188377 + ... + 63877188402.
It is an arithmetic number, because the mean of its divisors is an integer number (447140318730).
Almost surely, 21660806898127 is an apocalyptic number.
1660806898127 is a deficient number, since it is larger than the sum of its proper divisors (127754376793).
1660806898127 is a wasteful number, since it uses less digits than its factorization.
1660806898127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 127754376792.
The product of its (nonzero) digits is 13934592, while the sum is 62.
The spelling of 1660806898127 in words is "one trillion, six hundred sixty billion, eight hundred six million, eight hundred ninety-eight thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •