Properties of the Number 11050

Eleven Thousand Fifty

Basics

Value: 11049 → 11050 → 11051

Parity: even

Prime: No

Previous Prime: 11047

Next Prime: 11057

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 ² × 13 × 17

Divisors: 1, 2, 5, 10, 13, 17, 25, 26, 34, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10101100101010

Octal: 25452

Duodecimal: 648A

Hexadecimal: 2b2a

Square: 122102500

Square Root: 105.11898020814318

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·n+1)/3. A6331

Pairs (j, k) of numbers j<k such that φ(j) = φ(k), σ(j) = σ(k), d(j) = d(k). A134922

Numbers m that are the hypotenuse of exactly 22 distinct integer-sided right triangles, i.e., m² can be written as a sum of two squares in 22 ways. A97103

Numbers m such that there are precisely 20 groups of order m. A298911

a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2). A23855

Rhonda numbers in vigesimal number system. A255732

Numbers divisible by prime(d) for each digit d in their base-9 representation, none of which may be zero. A256879

T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r. A50157

Number of integer partitions of n with reverse-alternating sum equal to the reverse-alternating sum of their conjugate. A345196

Two-column table read by rows: Primitive distinct pairs that have the same value of φ, σ, and τ. A322688