Properties of the Number 70051

Seventy Thousand Fifty-One

Basics

Value: 70050 → 70051 → 70052

Parity: odd

Prime: Yes

Previous Prime: 70039

Next Prime: 70061

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 70051

Divisors: 1, 70051

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001000110100011

Octal: 210643

Duodecimal: 34657

Hexadecimal: 111a3

Square: 4907142601

Square Root: 264.6714944983687

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

Primes p of the form p = A161671(k) = A161671(k+1). A220220

Largest prime factor of 2ⁿ-3. A93817

Numbers k such that 2·10^k + 4·R_k - 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k. A102953

Primes p such that 2·p⁴-+15 are also prime. A174366

A partial product representation of f(n) = A015523(n) and L(n) = A072263(n). A72271

a(n) = ∑_{k=0..floor(n/3)} binomial(n-k,k) * binomial(n-2·k,k)². A383577

Number of Bottleneck-Monge matrices with 3 rows. In the formula below, P=3. A70051

(-1)σ perfect numbers: (-1)σ(a) = m·a for some integer m, where if a = Product p(i)^r(i) then (-1)σ(a) = ∏_i (-1 + ∑_s=1..r(i) p(i)^s). A34094

a(n) = number of distinct words arising in Post's tag system {00, 1101} applied to the word (100)ⁿ , or a(n) = -1 if this word has an unbounded trajectory. A302202