Properties of the Number 9058

Nine Thousand Fifty-Eight

Basics

Value: 9057 → 9058 → 9059

Parity: even

Prime: No

Previous Prime: 9049

Next Prime: 9059

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 7 × 647

Divisors: 1, 2, 7, 14, 647, 1294, 4529, 9058

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001101100010

Octal: 21542

Duodecimal: 52AA

Hexadecimal: 2362

Square: 82047364

Square Root: 95.17352573063583

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

Powers of cube root of 12 rounded up. A18011

Number of integer partitions of n with a difference < -1 and a conjugate difference < -1. A350839

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 11 multiples of n-1, n-2, ..., 1, for n>=1. A113748

Essentially parallel series-parallel networks with n labeled edges, multiple edges not allowed. A58379

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 2 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 2 3 4 6 or 7. A252167

Let f(n) = exp(π*sqrt(n)); sequence gives numbers n such that f(n) - floor(f(n)) < 1/10³. A127028

Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having a total of k uhd and uHd strings. A247294

Numbers which need eight 'Reverse and Add' steps to reach a palindrome. A65213

Number of partitions p of n such that (number of distinct parts of p) = max(p) - min(p). A239956

Bessel function |Y₀(n)| is a monotonically decreasing positive sequence. A46963