Properties of the Number 23215

Twenty-Three Thousand Two Hundred Fifteen

Basics

Value: 23214 → 23215 → 23216

Parity: odd

Prime: No

Previous Prime: 23209

Next Prime: 23227

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 4643

Divisors: 1, 5, 4643, 23215

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101010101111

Octal: 55257

Duodecimal: 11527

Hexadecimal: 5aaf

Square: 538936225

Square Root: 152.36469407313493

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+1)X(k+1) 0..7 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A186490

Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0. A211630

Number of 6-element subsets of [n] whose sum is a triangular number. A320852

Expansion of x/((1-x)(1-4x²)(1-5x)). A2041

Integer part of log(n)^{n^(1 - 1/n}). A62465

a(n) = floor(9ⁿ/7ⁿ). A94991

T(n,m)=Number of (n+1)X5 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors. A189174

Number of 6-ary rooted trees with n nodes and height at most 7. A36624

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2^p+1 + 2 - n and p is the smallest number such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 2. A49961

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