Properties of the Number 23009

Twenty-Three Thousand Nine

Basics

Value: 23008 → 23009 → 23010

Parity: odd

Prime: No

Previous Prime: 23003

Next Prime: 23011

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 7 × 19 × 173

Divisors: 1, 7, 19, 133, 173, 1211, 3287, 23009

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100111100001

Octal: 54741

Duodecimal: 11395

Hexadecimal: 59e1

Square: 529414081

Square Root: 151.68717810019407

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) = ∑_d∣n φ(d³). A68963

a(n) = (∑_k=0^n-1 (2k+1)*C(n-1,k)²*C(n+k,k)²)/n², where C(n,k) denotes the binomial coefficient n!/(k!(n-k)!). A246460

Number of distinct residues of xⁿ (mod n⁴), x=0..n⁴-1. A365101

Number of sequences s of length n with s[1]=1, s[2]=1, s[j-1]<s[j]<=s[j-2]+s[j-1] for j>=3. A5270

Lexicographically earliest sequence of distinct nonnegative terms wherein every digit of a(n) is the absolute difference of two adjacent digits in a(n+1). A362335

prime(n)*( prime(n)-n ). A161522

a(n) is the sum of the Wieferich and Wall-Sun-Sun residues of prime(n). A339639

Number of partitions of n into parts of 10 kinds. A23009

The sub-Fibonacci tree; a rooted tree in which every node with label k and parent node with label g has g child nodes that are assigned labels beginning with k+1 through k+g; the tree starts at generation n=0 with a root node labeled '1' and a child node labeled '2'. A125051