Properties of the Number 14495

Fourteen Thousand Four Hundred Ninety-Five

Basics

Value: 14494 → 14495 → 14496

Parity: odd

Prime: No

Previous Prime: 14489

Next Prime: 14503

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 13 × 223

Divisors: 1, 5, 13, 65, 223, 1115, 2899, 14495

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100010011111

Octal: 34237

Duodecimal: 847B

Hexadecimal: 389f

Square: 210105025

Square Root: 120.3951826278776

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) = least positive k such that the remainder when 3^k is divided by k is n. A78457

Number of heapable permutations of length n. A336282

Number of fixed points of mirroring operation on solid partitions. A96573

Numbers k that divide the alternating sum σ(1) - σ(2) + σ(3) - σ(4) + ... + ((-1)^k+1)*σ(k). A67931

Triangle read by rows: number of permutations of length n that require exactly k removals from the beginning to become heapable. A390368

a(n) = a(n-1) + a(n-2) + n + 2 with n>1, a(0)=a(1)=0. A210730

Smallest positive integer whose smallest coprime divisor shift is n. A366219

Triangle read by rows: T(n,k) = number of heapable permutations of length n that contain the max element on position k (positions starting from 0). A390546

Number of weighted lattice paths in F[n]. The members of F[n] are paths of weight n that start at (0,0), do not go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182905

Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array. A219293