Properties of the Number 94440

Ninety-Four Thousand Four Hundred Forty

Basics

Value: 94439 → 94440 → 94441

Parity: even

Prime: No

Previous Prime: 94439

Next Prime: 94441

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 787

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111000011101000

Octal: 270350

Duodecimal: 467A0

Hexadecimal: 170e8

Square: 8918913600

Square Root: 307.31091747609617

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

Coefficient triangle of polynomials (rising powers) related to Fibonacci convolutions. Companion triangle to A057995. A57280

Cardinality of the set fⁿ({s}), where f is a variant of the Collatz function that replaces any element·in the argument set with both x/2 and 3·x+1, and s is an arbitrary irrational number. A208127

Coefficient triangle of polynomials (falling powers) related to Fibonacci convolutions. Companion triangle to A057281. A57282

Number of length n 1..(3+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11. A254942

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 1, 1), (1, -1, -1), (1, 0, 1)}. A150180

Triangular array read by rows: T(n,k) = Fibonacci(n+1-k)*C(n,k-1), k = 1..n; n >= 1. A94440

T(n,k) is the number of length n 1..(k+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11. A254947