Properties of the Number 23040

Twenty-Three Thousand Forty

Basics

Value: 23039 → 23040 → 23041

Parity: even

Prime: No

Previous Prime: 23039

Next Prime: 23041

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁹ × 3 ² × 5

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101101000000000

Octal: 55000

Duodecimal: 11400

Hexadecimal: 5a00

Square: 530841600

Square Root: 151.7893276880822

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

a(0) = 1; for n > 0, a(n) = 2^n-1*n!. A2866

Number of invertible 2 X 2 matrices mod n. A252

Products of superprimorials (A006939). A181818

Triangle read by rows. T(n, k) are the coefficients of the Hermite polynomial of order n, for 0 <= k <= n. A60821

12-almost primes (generalization of semiprimes). A69273

a(n) = binomial(n,2) * 2^n-1. A1815

Convolution triangle of A002605(n) (generalized (2,2)-Fibonacci), n>=0. A73387

Number of the Lipschitz quaternions in a reduced system modulo n. A227499

Number T(n,k) of permutations p of [n] such that |p(i+k) - p(i)| <> k for i in [n-k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A333706

Triangle read by rows: T(n,k) = number of paths of n upsteps U and n downsteps D that contain k UUDs. A51288