Properties of the Number 1145

One Thousand One Hundred Forty-Five

Basics

Value: 1144 → 1145 → 1146

Parity: odd

Prime: No

Previous Prime: 1129

Next Prime: 1151

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 5 × 229

Divisors: 1, 5, 229, 1145

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001111001

Octal: 2171

Duodecimal: 7B5

Hexadecimal: 479

Square: 1311025

Square Root: 33.83784863137726

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

Numbers m such that the Bernoulli number B_2·m has denominator 66. A51229

Generalized 23-gonal (or icositrigonal) numbers: m*(21·m - 19)/2 with m = 0, +1, -1, +2, -2, +3, -3, ... A303303

Expansion of g.f. (1-x²)/(1-x-2·x²+x³). A28495

Number of integer partitions of n that are constant or whose part multiplicities, except possibly the first and last, are all even. A349060

Number of compositions of n with weakly increasing differences. A325546

Numbers k whose largest divisor <= sqrt(k) is 5. A161835

a(2·n) = 9·2ⁿ - 7, a(2·n+1) = 3·2ⁿ⁺² - 7. A354789

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) - m·k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows. A157152

Number T(n,k) of set partitions of [n] such that k is the largest element of the last block; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A271466

Square array A(n,k) by antidiagonals. A(n,k) is the number of length 2n k-ary words (n,k>=0), either empty or beginning with the first character of the alphabet, that can be built by repeatedly inserting doublets into the initially empty word. A183134