Properties of the Number 40412

Forty Thousand Four Hundred Twelve

Basics

Value: 40411 → 40412 → 40413

Parity: even

Prime: No

Previous Prime: 40387

Next Prime: 40423

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 10103

Divisors: 1, 2, 4, 10103, 20206, 40412

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001110111011100

Octal: 116734

Duodecimal: 1B478

Hexadecimal: 9ddc

Square: 1633129744

Square Root: 201.02736132178623

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 X k 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A305911

T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and vertical neighbors in a random 0..3 nXk array. A220430

Smallest sequence which lists the position of digits "3" in the sequence. A167453

Number of nX4 0..1 arrays with every element equal to 0, 1, 2 or 4 king-move adjacent elements, with upper left element zero. A297885

Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A305907

Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero. A305910

Triangle read by rows: T(n,m)=2·Binomial[n, m] - (m! - n! + (-m + n)!). A155451

Equals two maps: number of nX4 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and vertical neighbors in a random 0..3 nX4 array. A220429

T(n,k) is the number of (n+1) X (k+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A235289

Continued fraction for sqrt(433). A40412