ℕ atory
Play Now

Properties of the Number 14151

Fourteen Thousand One Hundred Fifty-One

Basics

Value: 14150 → 14151 → 14152

Parity: odd

Prime: No

Previous Prime: 14149

Next Prime: 14153

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 53 × 89

Divisors: 1, 3, 53, 89, 159, 267, 4717, 14151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11011101000111

Octal: 33507

Duodecimal: 8233

Hexadecimal: 3747

Square: 200250801

Square Root: 118.95797577295941

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 subsets of {1, 2, ..., n} such that no member is a sum of distinct other members. A151897
Numbers that are the sum of 11 positive 8th powers. A3389
Decimal Goedelization of antitheorems from propositional calculus, in Richard C. Schroeppel's metatheory of A101273. A100200
Put the natural numbers together without spaces and read them five at a time advancing one space each time. A193493
Number of compositions of n into distinct parts where each part i is marked with a word of length i over a ternary alphabet whose letters appear in alphabetical order. A261841
Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 23 ones. A31791
Number of (n+1) X 2 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one. A184063
T(n,n+2), array T as in A047040; T(n+2,n), array T given by A047050. A47047
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 1), (1, 1, 1)}. A150947
a(n) = start of a sequence of at least n consecutive primes, p1, p2, ..., pn (say), all == 1 mod 4, such that A(p1) > A(p2) > ... > A(pn), where A(p) (see A145010) is the area of the Pythagorean triangle with hypotenuse p. A144954