Properties of the Number 23315

Twenty-Three Thousand Three Hundred Fifteen

Basics

Value: 23314 → 23315 → 23316

Parity: odd

Prime: No

Previous Prime: 23311

Next Prime: 23321

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 4663

Divisors: 1, 5, 4663, 23315

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101100010011

Octal: 55423

Duodecimal: 115AB

Hexadecimal: 5b13

Square: 543589225

Square Root: 152.6925014530838

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

Euler transform of Euler totient function φ(n), cf. A000010. A61255

T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s. A295551

Odd semiprimes p·q, such that Stern polynomial B(p·q,x) is a product of B(p,x) and B(q,x). A391256

a(n) = ∑_k=0..n (k+2) * binomial(4·n-3·k+2,n-k)/(4·n-3·k+2). A390720

Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,2,1. A222122

Number of nX5 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s. A295548

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

Number of n X n 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1's. A295545

Primes that remain prime through 4 iterations of function f(x) = 5·x + 6. A23315

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