Properties of the Number 23467

Twenty-Three Thousand Four Hundred Sixty-Seven

Basics

Value: 23466 → 23467 → 23468

Parity: odd

Prime: No

Previous Prime: 23459

Next Prime: 23473

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 31 × 757

Divisors: 1, 31, 757, 23467

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101110101011

Octal: 55653

Duodecimal: 116B7

Hexadecimal: 5bab

Square: 550700089

Square Root: 153.18942522250026

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(0) = 0, a(1) = a(2) = 1, a(3) = 2, a(4) = 4, for n>3: a(n+1) = SORT[ a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4)], where SORT places digits in ascending order and deletes 0's. A108565

Number of partitions of n into distinct parts with boundary size 7. A227564

a(n) = a(n-1) + a(n-2) + n + 1, a(0) = a(1) = 1. A210677

a(n) = the number of ways that at least two distinct primes <= prime(n) sum to a prime. A262765

Expansion of ∏_k>=1 1/(1 - x^k / (1 - k·x)). A336990

Numbers k such that 7·2^k + 5 is prime. A58595

Take an n X n square grid of points in the plane; a(n) = number of non-isomorphic ways to divide the points into two sets using a straight line. A116696

Number of partitions of [n] whose blocks can be ordered such that the i-th block has at least i elements and no block j > i has an element smaller than the i-th smallest element of block i. A362893

Number of set partitions of [n] into exactly three blocks where sizes of distinct blocks are coprime. A280881

a(n) = n-25. A23467