Properties of the Number 23354

Twenty-Three Thousand Three Hundred Fifty-Four

Basics

Value: 23353 → 23354 → 23355

Parity: even

Prime: No

Previous Prime: 23339

Next Prime: 23357

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 11677

Divisors: 1, 2, 11677, 23354

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101101100111010

Octal: 55472

Duodecimal: 11622

Hexadecimal: 5b3a

Square: 545409316

Square Root: 152.8201557386983

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

a(n) = 4·a(n-1) + 3·a(n-2), a(0) = 1, a(1) = 2. A108851

G.f.: (1 + 5·x + 5·x² + x³)/∏_i=1..10 (1 - xⁱ). A256977

Expansion of g.f. A(x) satisfying 1 = ∑_n=-oo..+oo (-1)ⁿ * xⁿ * (A(x) + x^3·n-1)ⁿ⁺¹. A363143

Number of sequences of n integers p(i) i=0..n-1 with 0<=p(i)<=8·i and -8<p(i)-p(i-1)<=8. A180913

a(n) is the position of the first occurrence of 2n as a local minimum in the prime gaps (A001223). A286711

Triangle read by rows: T(n,k) is the number of coalescent histories for an n-leaf caterpillar species tree and an identically labeled k-pseudocaterpillar gene tree, 3 <= k <= n. A380766

T(n,k)=number of sequences of n integers p(i) i=0..n-1 0<=p(i)<=k·i and -k<p(i+1)-p(i)<=k. A180915

Tetradic primes (primes in A006072). A68188

Array read by antidiagonals: ((floor(sqrt(n)) + sqrt(n))^k + (floor(sqrt(n)) - sqrt(n))^k)/2 for columns k >= 0 and rows n >= 0. A191347

Primes that remain prime through 5 iterations of function f(x) = 9x + 8. A23354