Properties of the Number 14052

Fourteen Thousand Fifty-Two

Basics

Value: 14051 → 14052 → 14053

Parity: even

Prime: No

Previous Prime: 14051

Next Prime: 14057

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1171

Divisors: 1, 2, 3, 4, 6, 12, 1171, 2342, 3513, 4684

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011100100

Octal: 33344

Duodecimal: 8170

Hexadecimal: 36e4

Square: 197458704

Square Root: 118.54113210189955

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

T(n,m) = number of 1..m integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171275

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P. A225385

a(n) is the number of edges formed by n-secting the angles of a hexagon. A335735

Number of 1..n integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5. A171343

Low-temperature series for magnetization in zero-field 3-state Potts model on cubic lattice. A7270

Numbers whose set of base-8 digits is {3,4}. A32832

a(n) = smallest k such that k! ends in 2ⁿ, not counting the trailing zeros. A58885

Number of 1..5 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171279

Number of partitions of n with distinct occurrences of parts. A166239

a(n) = floor((n+1/n)ⁿ). A14052