Properties of the Number 341

Three Hundred Forty-One

Basics

Value: 340 → 341 → 342

Parity: odd

Prime: No

Previous Prime: 337

Next Prime: 347

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 11 × 31

Divisors: 1, 11, 31, 341

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101010101

Octal: 525

Duodecimal: 245

Hexadecimal: 155

Square: 116281

Square Root: 18.466185312619388

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

Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2·a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2ⁿ/3. A1045

Moser-de Bruijn sequence: sums of distinct powers of 4. A695

a(n) = sigma₂(n): sum of squares of divisors of n. A1157

Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers. A1567

a(2n) = 2·a(2n-1), a(2n+1) = 2·a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits). A975

a(n) = (4ⁿ - 1)/3. A2450

Octagonal numbers: n*(3·n-2). Also called star numbers. A567

Number of partitions of n into parts each of which is used a different number of times. A98859

Binary palindromes: numbers whose binary expansion is palindromic. A6995

a(n) = ∑_{d divides n} q(d), where q(d) = A000009 = number of partitions of d into distinct parts. A47966