Properties of the Number 14682

Fourteen Thousand Six Hundred Eighty-Two

Basics

Value: 14681 → 14682 → 14683

Parity: even

Prime: No

Previous Prime: 14669

Next Prime: 14683

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 2447

Divisors: 1, 2, 3, 6, 2447, 4894, 7341, 14682

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100101011010

Octal: 34532

Duodecimal: 85B6

Hexadecimal: 395a

Square: 215561124

Square Root: 121.16930304330384

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

Number of integer partitions of n with at least one pair of consecutive divisible parts. A328221

Numbers which are the sum of their proper divisors containing the digit 4. A59463

Largest number which requires n iterations of the unitary totient function (A047994) to reach 1. A225172

Start with 443; if even, divide by 2; if odd, add next three primes: Orbit of 443 under iterations of A174221, the "PrimeLatz" map. A293978

a(n) = a(n-1) + a(n-3) + a(n-5). A122115

a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n·a(n-1). A95234

a(0) = 0; for n >= 1, a(n) = -(3/2)*(a(n-1)+A355905(n-1)). A355906

a(n) = ∑_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604. A47881

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 694", based on the 5-celled von Neumann neighborhood. A273411

Rounded value of z(n)*prime(n), where z(n) = imaginary part of n-th nontrivial zero of the ζ function and prime(n) = n-th prime. A342756