Properties of the Number 70395

Seventy Thousand Three Hundred Ninety-Five

Basics

Value: 70394 → 70395 → 70396

Parity: odd

Prime: No

Previous Prime: 70393

Next Prime: 70423

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 13 × 19 ²

Divisors: 1, 3, 5, 13, 15, 19, 39, 57, 65, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001001011111011

Octal: 211373

Duodecimal: 348A3

Hexadecimal: 112fb

Square: 4955456025

Square Root: 265.3205608316099

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

a(n) is the number of integers·that can be written x = (2^c(1) - 2^c(2) - 3·2^c(3) - 3²*2^c(4) - ... - 3^m-2*2^c(m) - 3^m-1) / 3^m for integers c(1), c(2), ..., c(m) such that n = c(1) > c(2) > ... > c(m) > 0 and c(1) - c(2) ≠ 2 if m >= 2. A131450

Number A(n,k) of k-tuples (p₁, p₂, ..., p_k) of Dyck paths of semilength n, such that each p_i is never below p_i-1 and the upper path p_k only touches the x-axis at its endpoints; square array A(n,k), n>=0, k>=0, read by antidiagonals. A378112

Expansion of ∏_k>=1 (1-q^2·k)/(1-q^k)⁴. A350642

Number of 3-tuples (p₁, p₂, p₃) of Dyck paths of semilength n, such that each p_i is never below p_i-1 and the upper path p₃ only touches the x-axis at its endpoints. A378114

a(n) = 6ⁿ mod 19. A70395