Properties of the Number 3397

Three Thousand Three Hundred Ninety-Seven

Basics

Value: 3396 → 3397 → 3398

Parity: odd

Prime: No

Previous Prime: 3391

Next Prime: 3407

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 43 × 79

Divisors: 1, 43, 79, 3397

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110101000101

Octal: 6505

Duodecimal: 1B71

Hexadecimal: d45

Square: 11539609

Square Root: 58.283788483591216

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

T(n,k)=Number of 0..6 colorings of an nx(k+1) array circular in the k+1 direction with new values 0..6 introduced in row major order. A214187

n coded as binary word of length=n with k-th bit set iff k is prime (1<=k<=n), decimal value. A72762

Number of distinct resistances that can be produced using n unit resistors in series, parallel, bridge or fork configurations. A337516

Numbers k such that k¹⁰ == 1 (mod 11³). A56085

Irregular array read by rows. a(n) is the largest element in the primitive Collatz-like 3x+k cycle associated with A226607(n). A226608

Length of the maximal prefix of noncomposite numbers on row n of A249821. A250473

Total number of parts coprime to n in the partitions of n into 5 parts. A363323

Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1. A5424

Diagonal of A083167. A83168

Number of set partitions B'_t(n) of {1,2,...,t} into at most n parts, so that no part contains both 1 and t, or both i and i+1 with 1 <= i < t; triangle B'_t(n), t>=0, 0<=n<=t, read by rows. A261137