Properties of the Number 58269

Fifty-Eight Thousand Two Hundred Sixty-Nine

Basics

Value: 58268 → 58269 → 58270

Parity: odd

Prime: No

Previous Prime: 58243

Next Prime: 58271

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 19423

Divisors: 1, 3, 19423, 58269

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1110001110011101

Octal: 161635

Duodecimal: 29879

Hexadecimal: e39d

Square: 3395276361

Square Root: 241.38972637624826

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

Triangle, read by rows, where row n equals the coefficients of y^k in R_n-1(y+y²) for k=3..n, where R_n(y) is the n-th row polynomial in y for n>=3 with R₃(y)=y³. A187120

A diagonal of triangle A187120. A187121

G.f. A(x) satisfies: [xⁿ⁺³] A(Fⁿ(x)) = 0 for n>0 where Fⁿ(x) denotes the n-th iteration of F(x) = x+x² with F⁰(x)=x. A187124

An approximation to sigma_3/2(n): floor( ∑_d∣n d^3/2 ). A58269

Difference between π(10ⁿ) and nearest integer to (F[2n+1](S(n)))² where π(10ⁿ) = number of primes <= 10ⁿ (A006880), F[2n+1](x) are Fibonacci polynomials of odd indices [2n+1] and S(n) = ∑_i=0..2 (C(i)*(log(log(A*(B+n²))))²ⁱ) (see A227693). A227694