Properties of the Number 23970

Twenty-Three Thousand Nine Hundred Seventy

Basics

Value: 23969 → 23970 → 23971

Parity: even

Prime: No

Previous Prime: 23957

Next Prime: 23971

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 17 × 47

Divisors: 1, 2, 3, 5, 6, 10, 15, 17, 30, 34

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101110110100010

Octal: 56642

Duodecimal: 11A56

Hexadecimal: 5da2

Square: 574560900

Square Root: 154.82247898803325

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

Number of compositions of n whose non-adjacent parts are weakly decreasing. A333148

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers). A24459

Numbers k such that 127·2^k+1 is prime. A32413

p(11p-7) where p is prime. A98998

Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with irreducible component of size k. A371659

G.f. A(x) satisfies [x^2·n] A(x)^3·n = -3 and [x^2·n+1] A(x)^3·n+1 = [x^2·n+1] A(x)^3·n+2 for n >= 1. A376225

Number of (n+1) X (2+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234652

First bit in fractional part of binary expansion of cube root of n. A23970