Properties of the Number 14202

Fourteen Thousand Two Hundred Two

Basics

Value: 14201 → 14202 → 14203

Parity: even

Prime: No

Previous Prime: 14197

Next Prime: 14207

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 263

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 263, 526

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011101111010

Octal: 33572

Duodecimal: 8276

Hexadecimal: 377a

Square: 201696804

Square Root: 119.17214439624723

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) = ∑_{k=0..floor(n/3)} binomial(2·n-3·k, n). A105872

Triangular array formed by the little Schröder numbers s(n,k). A110440

Numbers k such that k² and k³ have the same set of digits. A29797

a(n) = Sum of all numbers of divisors of all numbers < (n+1)². A168011

a(n) = (3/n³) * ∑_d∣n (-1)^n+d*moebius(n/d)*binomial(2·d,d). A254593

Number of partitions of n such that neither floor(n/2) nor ceiling(n/2) is a part. A238623

Number of integer partitions of n whose multiset multiplicity kernel is a submultiset. A367684

Numbers d_n used in recurrence for series-parallel numbers. A36655

a(n) = ∑_{i=0..floor(q(n)/3)} binomial(n-3*(i+1), q(n)-3·i) with q(n) = ceiling((n-3)/2). A366107

Starting positions of strings of 3 0's in the decimal expansion of π. A50202