Properties of the Number 3358

Three Thousand Three Hundred Fifty-Eight

Basics

Value: 3357 → 3358 → 3359

Parity: even

Prime: No

Previous Prime: 3347

Next Prime: 3359

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 23 × 73

Divisors: 1, 2, 23, 46, 73, 146, 1679, 3358

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100011110

Octal: 6436

Duodecimal: 1B3A

Hexadecimal: d1e

Square: 11276164

Square Root: 57.94825277780168

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

Sum of squares of the first n primes. A24450

a(n) = -2·n² + 12·n - 14. A147973

T(n,k) = number of (n+1) X (k+1) 0..2 arrays with no element greater than all horizontal neighbors or equal to all vertical neighbors. A239178

T(n,k)=Number of length n 0..k arrays with each partial sum starting from the beginning no more than sqrt(3) standard deviations from its mean. A244940

Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists. A69554

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically. A207661

a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 2's. A254447

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically. A207895

Number of different prime signatures of the m values when A056239(m) is equal to n. A88887

Positions of 19 after decimal point in decimal expansion of π. A134219