Properties of the Number 23046

Twenty-Three Thousand Forty-Six

Basics

Value: 23045 → 23046 → 23047

Parity: even

Prime: No

Previous Prime: 23041

Next Prime: 23053

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 23 × 167

Divisors: 1, 2, 3, 6, 23, 46, 69, 138, 167, 334

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101000000110

Octal: 55006

Duodecimal: 11406

Hexadecimal: 5a06

Square: 531118116

Square Root: 151.8090906368917

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

σ(n)-n values in A085844. A216383

Sum of all parts of all partitions of n that contain 1 as a part. A228816

Squares visited by a knight on a spirally numbered board, moving always to the lowest available unvisited square, or one step back if no unvisited square is available. A323809

9th differences of factorial numbers. A23046

a(1)=0; a(n+1) = a(n) - gpf(n) if a(n) >= gpf(n), otherwise a(n+1) = a(n) + lpf(n), where gpf(n) is the greatest prime dividing n (A006530) and lpf(n) is the least prime dividing n (A020639). A248820

Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303238

Array read by antidiagonals upwards: A(n, k) = if(n mod 2 = 0, floor((n+2^k-2) / 2^k), n * (k·2^k+1) + 1). A391114