Properties of the Number 57475

Fifty-Seven Thousand Four Hundred Seventy-Five

Basics

Value: 57474 → 57475 → 57476

Parity: odd

Prime: No

Previous Prime: 57467

Next Prime: 57487

Digit Sum: 28

Digital Root: 1

Palindrome: Yes

Factorization: 5 ² × 11 ² × 19

Divisors: 1, 5, 11, 19, 25, 55, 95, 121, 209, 275

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1110000010000011

Octal: 160203

Duodecimal: 29317

Hexadecimal: e083

Square: 3303375625

Square Root: 239.73944189473704

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

Records for minima of the positive distance d between the seventh power of a positive integer·and the square of an integer y such that d = x⁷ - y² (x <> k² and y <> k⁷). A179784

Structured rhombic triacontahedral numbers (vertex structure 7). A100165

a(n) = ∏_{d∣n, d>1} prime(1+(d mod 12)). A320112

Triangular array read by rows: T(n,k) is the number of ways to partition an n-set into exactly k blocks and then partially order the blocks, n>=1, 1<=k<=n. A247231

p-INVERT of the positive integers, where p(S) = 1 - S⁵. A290893

p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - S⁵. A291218

Numbers n such that ψ(n) = 2*φ(n). A292390

Number of ways to write n as an ordered sum of ten positive Fibonacci numbers (with a single type of 1). A357730

Number of k, 1 <= k <= n, such that gcd(n,k) = gcd(n+1,k) = 1. A57475