Properties of the Number 8945

Eight Thousand Nine Hundred Forty-Five

Basics

Value: 8944 → 8945 → 8946

Parity: odd

Prime: No

Previous Prime: 8941

Next Prime: 8951

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 1789

Divisors: 1, 5, 1789, 8945

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001011110001

Octal: 21361

Duodecimal: 5215

Hexadecimal: 22f1

Square: 80013025

Square Root: 94.57801012920498

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 1 3 6 or 7. A252192

Output of the linear congruential pseudo-random number generator rand() used in Microsoft's Visual C++. A96558

Digitally balanced numbers in both bases 2 and 3. A49361

Row sums of triangle A060924 (odd part of bisection of Lucas triangle). A60927

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 123", based on the 5-celled von Neumann neighborhood. A270210

Lexicographically first sequence of distinct terms such that any set of six successive digits can be reordered as {d, d+1, d+2, d+3, d+4, d+5}, d being the smallest of the six digits. A302501

Lexicographically earliest sequence of distinct positive numbers such that if we add six successive digits the result is divisible by 6. A327456

a(n) = ∑_k=0..n q(n,k) * !k, where q(n,k) = number of partitions of n into k distinct parts and !k = subfactorial of k. A331518

a(n) = number of (s(0),s(1),...,s(n)) such that every s(i) is a nonnegative integer, s(0) = 1, s(n) = 4, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also a(n) = T(n,n-3), where T is the array in A026120. A26125

a(n) = ceiling(sqrt(8·10ⁿ)). A35075