Properties of the Number 40368

Forty Thousand Three Hundred Sixty-Eight

Basics

Value: 40367 → 40368 → 40369

Parity: even

Prime: No

Previous Prime: 40361

Next Prime: 40387

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 29 ²

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 29

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001110110110000

Octal: 116660

Duodecimal: 1B440

Hexadecimal: 9db0

Square: 1629575424

Square Root: 200.91789367798975

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

Starts of runs of 3 consecutive Zeckendorf-Niven numbers (A328208). A328210

Integer areas of integer-sided triangles such that the distance between the incenter and the circumcenter is an integer. A231174

Number of solutions to x² + y² + z² + w² <= n², where x, y, z, w are positive odd integers. A349611

If p and q are twin primes then pq + 1 is always divisible by 3, except for (p,q)=(3,5). Sequence gives values of (pq + 1)/3. A165280

Number of n X 2 0..1 arrays with no element unequal to a strict majority of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A280227

Triangle read by rows, generalized Eulerian polynomials evaluated at x = -1. A337996

a(1) = 1, a(2) = 16, a(n) = lcm(48, 2n²) for n>2. A32444

Triangle T(n,m), [x·A(x)]^m=sum(n>=m T(n,m)*xⁿ), where A(x) satisfies x·A(x)²= -(2·x*A(x)+sqrt(1-4·x*A(x))-1)/(4·x*A(x)+sqrt(1-4·x*A(x))-1). A188109

Number of (n+1)X(n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250763

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250769