Properties of the Number 11127

Eleven Thousand One Hundred Twenty-Seven

Basics

Value: 11126 → 11127 → 11128

Parity: odd

Prime: No

Previous Prime: 11119

Next Prime: 11131

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 3709

Divisors: 1, 3, 3709, 11127

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101101110111

Octal: 25567

Duodecimal: 6533

Hexadecimal: 2b77

Square: 123810129

Square Root: 105.48459603183775

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

Partial sums of A097988 (d₃(n)²). A330570

Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m. A111045

Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence. A167519

The number of tilings of an equilateral triangle of side length n with k lozenges and n² - 2·k unit triangles. Triangle T(n, k) with n >= 1 and 0 <= k <= n*(n + 1)/2, read by rows. A273464

Expansion of e.g.f. 1/sqrt(7 - 6·exp(x)). A354252

Number of tilings of an equilateral triangle of side length n with unit triangles (of side length 1) and exactly three unit "lozenges" or "diamonds" (also of side length 1). A326368

Triangle T(n,k) giving number of fixed 3 X k polyominoes with n cells (n >= 3, 1<=k<=n-2). A59679

Numbers in cycles of RATS sequences. A161596

Except for the first term the number in the sequence is the smallest number in a new cycle of a RATS sequence with a new destiny. The first term is the best analog of this for the "infinite cycle". A161592

Sum of numbers in the n-th antidiagonal of the reciprocity array of 2. A259580