Properties of the Number 23018

Twenty-Three Thousand Eighteen

Basics

Value: 23017 → 23018 → 23019

Parity: even

Prime: No

Previous Prime: 23017

Next Prime: 23021

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 17 × 677

Divisors: 1, 2, 17, 34, 677, 1354, 11509, 23018

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100111101010

Octal: 54752

Duodecimal: 113A2

Hexadecimal: 59ea

Square: 529828324

Square Root: 151.71684151734772

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 integer partitions of n such that, for all parts x, x - 1 or x + 1 is also a part. A355394

Number of compositions of n with equal circular differences up to sign. A325558

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of u²+v². A345434

Boris Stechkin's function. A55004

Number of double nodes (exactly two nodes on that level) for all Motzkin paths of length n. A51485

a(n) = ∑_y=1..n ∑_x=1..n floor((x^k + y^k)^1/k) with k = 2. A211791

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers). A24590

G.f. A(x) satisfies: A(x + A(x)*A(-x)) = x - A(x)*A(-x). A295767

Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UH, HD and DU. A329698

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers). A25104