Properties of the Number 68001

Sixty-Eight Thousand One

Basics

Value: 68000 → 68001 → 68002

Parity: odd

Prime: No

Previous Prime: 67993

Next Prime: 68023

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 19 × 1193

Divisors: 1, 3, 19, 57, 1193, 3579, 22667, 68001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10000100110100001

Octal: 204641

Duodecimal: 33429

Hexadecimal: 109a1

Square: 4624136001

Square Root: 260.7700136135288

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

Expansion of exp(3·x) - exp(x)*(1-BesselI₀(2·x)). A81673

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

Number of (w,x,y,z) with all terms in {0,...,n} such that range{w,x,y,z} is not one of the numbers w,x,y,z. A212569

Partial sums of icosahedral numbers (A006564). A302560

Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise coprime. A201218

a(n) = [ (3rd elementary symmetric function of P(n))/(first elementary symmetric function of P(n)) ], where P(n) = {1, p(1), p(2), ..., p(n-1)}, where p(0) = 1. A24532

The infinite Fibonacci word: start with 1, repeatedly apply the morphism 1->12, 2->1, take limit; or, start with S(0)=2, S(1)=1, and for n>1 define S(n)=S(n-1)S(n-2), then the sequence is S(oo). A3842

a(n) = 1 + ∑_i=1..n (n-i+1)*φ(i). A5598

Smallest number whose n-th power (A067457) starts with n. A68001