Base | Representation |
---|---|
bin | 11000001011100011101… |
… | …001011011011101011101 |
3 | 12212212002002210200020221 |
4 | 120023203221123131131 |
5 | 204211103211232134 |
6 | 3311210321441341 |
7 | 231023616413650 |
oct | 30134351333535 |
9 | 5785062720227 |
10 | 1661676664669 |
11 | 59079318052a |
12 | 22a0641a0251 |
13 | c0906b4c1a8 |
14 | 5a5d5b0d897 |
15 | 2d35612b5b4 |
hex | 182e3a5b75d |
1661676664669 has 16 divisors (see below), whose sum is σ = 2010817657728. Its totient is φ = 1340479429632.
The previous prime is 1661676664663. The next prime is 1661676664693. The reversal of 1661676664669 is 9664666761661.
It is not a de Polignac number, because 1661676664669 - 29 = 1661676664157 is a prime.
It is a super-2 number, since 2×16616766646692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1661676664598 and 1661676664607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1661676664663) 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 in 15 ways as a sum of consecutive naturals, for example, 5491717 + ... + 5786389.
It is an arithmetic number, because the mean of its divisors is an integer number (125676103608).
Almost surely, 21661676664669 is an apocalyptic number.
It is an amenable number.
1661676664669 is a deficient number, since it is larger than the sum of its proper divisors (349140993059).
1661676664669 is a wasteful number, since it uses less digits than its factorization.
1661676664669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342084.
The product of its digits is 423263232, while the sum is 70.
The spelling of 1661676664669 in words is "one trillion, six hundred sixty-one billion, six hundred seventy-six million, six hundred sixty-four thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •