Properties of the Number -10669

Ten Thousand Six Hundred Sixty-Nine

Basics

Value: -10670 → -10669 → -10668

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 47 × 227

Divisors: 1, 47, 227, 10669

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10100110101101

Octal: -24655

Duodecimal: -6211

Hexadecimal: -29ad

Square: 113827561

Square Root: 103.29085148259743

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Numerators in the expansion of g.f. x²/(x - log(1 + x)). A392798

Least inverse of A015910: smallest integer k > 0 such that 2^k mod k = n, or 0 if no such k exists. A36236

Numbers m such that 2^m == 6 (mod m). A128122

Positions of ones in A264977; positions of twos in A277330. A277701

Numbers k such that k·4^k + 1 is prime. A7646

a(n) = 6·n² - 10·n + 5. A136392

a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k. A24842

Semiprimes p·q such that 2^p mod q == 2^q mod p. A179707

Semiprimes p·q with p < q and 2^p (mod q) == 2^q (mod p). A179839

Least positive number k such that 2^k mod k = 2n, or 0 if no such k exists. A122182