Properties of the Number 1149

One Thousand One Hundred Forty-Nine

Basics

Value: 1148 → 1149 → 1150

Parity: odd

Prime: No

Previous Prime: 1129

Next Prime: 1151

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 383

Divisors: 1, 3, 383, 1149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001111101

Octal: 2175

Duodecimal: 7B9

Hexadecimal: 47d

Square: 1320201

Square Root: 33.896902513356586

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

The "comma sequence": the lexicographically earliest sequence of positive numbers with the property that the sequence formed by the pairs of digits adjacent to the commas between the terms is the same as the sequence of successive differences between the terms. A121805

a(1)=a(2)=a(3)=1, a(4)=3; thereafter a(n) = a(n-1) + a(n-3). A179070

Number of integer partitions of n without any three parts (a,b,c) (repeats allowed) satisfying a + b = c. A variation of sum-free partitions. A364345

Number of partitions of n that sorted in increasing order contain a part k in position k for some k. A238395

Numbers m such that the Bernoulli number B_2·m has denominator 42. A51227

Coordination sequence for (3,4,4) tiling of hyperbolic plane. A265075

Numbers k such that k² has an odd number of digits and the middle digit is 0. A279420

Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes. A30018

A triangle formed like generalized Pascal's triangle. The rule is T(n,k) = 2·T(n-1,k-1) + T(n-1,k), the left border is n and the right border is n² instead of 1. A228576

Array read by antidiagonals: T(n,r) is the number of connected r-regular loopless multigraphs on n unlabeled nodes. A328682