Properties of the Number 68970

Sixty-Eight Thousand Nine Hundred Seventy

Basics

Value: 68969 → 68970 → 68971

Parity: even

Prime: No

Previous Prime: 68963

Next Prime: 68993

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 11 ² × 19

Divisors: 1, 2, 3, 5, 6, 10, 11, 15, 19, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10000110101101010

Octal: 206552

Duodecimal: 33AB6

Hexadecimal: 10d6a

Square: 4756860900

Square Root: 262.6214004988931

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) = n*(n + 1)*(n + 2)*(7·n - 5)/12. A264850

If n mod 2 = 0 then a(n) = n⁴/4 - 2·n² + 3·n; otherwise, a(n) = n⁴/4 - 2·n² + 3·n - 5/4. A64835

Number of electrons per subshell in element Z=n expressed as a 56-bit unsigned integer. A333997

Nonsquare positive integers k such that k = a·b = c·m + b and b² = a·m + c where m > 1, 0 < a, b, c < m. A347168

Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0. A53476

Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1. A98197

Number of excursions of length n with Motzkin-steps avoiding the consecutive steps UU, UD, HH and DU. A329689

a(n) = ∑_d∣n φ(d⁴). A68970