Properties of the Number 10990

Ten Thousand Nine Hundred Ninety

Basics

Value: 10989 → 10990 → 10991

Parity: even

Prime: No

Previous Prime: 10987

Next Prime: 10993

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 7 × 157

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 157, 314

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 10101011101110

Octal: 25356

Duodecimal: 643A

Hexadecimal: 2aee

Square: 120780100

Square Root: 104.83320084782301

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

a(n) = n*(n² + 1)/2. A6003

Weird numbers: abundant (A005101) but not pseudoperfect (A005835). A6037

Numbers n for which (4+n!)/4 is prime. A139061

Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188). A64114

Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985). A292986

Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983). A306984

Triangle read by rows, 0 <= k < n, n >= 2: T(n,k) is the eventual period of the modified Fibonacci sequence x(j) (or 0 if x(j) never enters a cycle) defined as follows: x(0) = 0, x(1) = 1, and for j > 1 x(j) is obtained from x(j-1) + x(j-2) by deleting all occurrences of the digit k in base n. A306773

a(n) = (n - 1)*(4·n² - 8·n + 5). A317297

Number of ways to write n as an ordered sum of 10 prime powers (including 1). A341139

Row sums of the triangular array A246696. A246697