Properties of the Number 3354

Three Thousand Three Hundred Fifty-Four

Basics

Value: 3353 → 3354 → 3355

Parity: even

Prime: No

Previous Prime: 3347

Next Prime: 3359

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 13 × 43

Divisors: 1, 2, 3, 6, 13, 26, 39, 43, 78, 86

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110100011010

Octal: 6432

Duodecimal: 1B36

Hexadecimal: d1a

Square: 11249316

Square Root: 57.91372894228103

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

Mian-Chowla sequence (a B₂ sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct. A5282

Partial sums of A299283. A299284

Number of integer partitions of n with more than one part of least multiplicity. A362609

Number of incomplete strict integer partitions of n, meaning not every number from 0 to n is the sum of some submultiset. A365831

Number of compositions of n with parts in N which avoid the consecutive pattern 123. A128761

a(n) = 2·n² + 8·n. A67728

a(n) = (2·n-1)*(n² -n +6)/6. A49480

T(n,k)=Number of nXk binary arrays without the pattern 1 1 0 diagonally, vertically, antidiagonally or horizontally. A188607

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

T(n,k)=Number of binary arrays of length n+2·k-1 with fewer than k ones in any length 2k subsequence (=less than 50% duty cycle). A213118