Properties of the Number 68069

Sixty-Eight Thousand Sixty-Nine

Basics

Value: 68068 → 68069 → 68070

Parity: odd

Prime: No

Previous Prime: 68059

Next Prime: 68071

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 43 × 1583

Divisors: 1, 43, 1583, 68069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100111100101

Octal: 204745

Duodecimal: 33485

Hexadecimal: 109e5

Square: 4633388761

Square Root: 260.9003641239314

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 e.g.f. S(x) satisfying S(x) = sinh( x·cosh( 2·x*sqrt(1 + S(x)²) ) ), where a(n) is the coefficient of x^2·n+1/(2·n+1)! in S(x) for n >= 0. A372812

a(n) = floor( n*(n-1)*(n-2)*(n-3)/29 ). A11939

Cyclops numbers with circular digits {0,6,8,9}. A274765

Carryless squares of carryless primes (cf. A169887). A169904

T(n,k) = number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and three times sum of squares <= n·k*(k+1). A208805

Expansion of e.g.f. C(x) satisfying C(x) = cosh( x·cosh(2·x*C(x)) ), where a(n) is the coefficient of x^2·n/(2·n)! in C(x) for n >= 0. A372811

Expansion of e.g.f. D(x) satisfying D(x) = cosh( 2·x*cosh(x·D(x)) ), where a(n) is the coefficient of x^2·n/(2·n)! in D(x) for n >= 0. A372813

Expansion of e.g.f. T(x) satisfying T(x) = (1/2) * sinh( 2·x*cosh( x·sqrt(1 + 4·T(x)²) ) ), where a(n) is the coefficient of x^2·n+1/(2·n+1)! in T(x) for n >= 0. A372814

a(n) is the least k which is the start of n consecutive integers each with a different number, 1 through n, of distinct prime factors. A68069