Properties of the Number 3471

Three Thousand Four Hundred Seventy-One

Basics

Value: 3470 → 3471 → 3472

Parity: odd

Prime: No

Previous Prime: 3469

Next Prime: 3491

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 13 × 89

Divisors: 1, 3, 13, 39, 89, 267, 1157, 3471

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110110001111

Octal: 6617

Duodecimal: 2013

Hexadecimal: d8f

Square: 12047841

Square Root: 58.915193286621744

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

Number of normal multiset partitions of weight n where every part has the same sum. A326518

Number of integer partitions of n whose negated run-lengths are unimodal. A332638

Super-3 Numbers (3n³ contains substring '333' in its decimal expansion). A14569

Number of primes in the interval [prime(n), prime(n)²]. A54272

Array T(n,k) read by antidiagonals: T(n,k) is the number of [n,k]-triangulations in the plane, n >= 0, k >= 0. A169808

Least k such that there are exactly n multisets that can be obtained by choosing a divisor of each prime index of k. A355734

T(n,k)=Number of nXk 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing. A223961

Differences of two positive 4th powers. A147857

Triangle, read by rows, T(n,k) = t(n-k, k) where t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(x) = x + 3. A257180

G.f.: ∏_k>=1 (1+x^k²) / (1-x^k). A280204