ℕ atory
Play Now

Properties of the Number 18172

Eighteen Thousand One Hundred Seventy-Two

Basics

Value: 18171 → 18172 → 18173

Parity: even

Prime: No

Previous Prime: 18169

Next Prime: 18181

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 2 × 7 × 11 × 59

Divisors: 1, 2, 4, 7, 11, 14, 22, 28, 44, 59

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100011011111100

Octal: 43374

Duodecimal: A624

Hexadecimal: 46fc

Square: 330221584

Square Root: 134.80356078383093

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 partitions of n which represent first player winning Chomp positions with unique winning moves. A112472
Number of unrooted self-avoiding walks with n steps that can make turns from the set 0, +-π/4, +-π/2, +-3*π/4. A306178
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two. A206197
T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. A207949
Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i. A56219
Number of partitions of 2n whose Ferrers-Young diagram cannot be tiled with dominoes. A304710
Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)2. A350797
Indices of records in A352187. A352192
Numbers k such that 80·Rk + 3 is prime, where Rk = 11...1 is the repunit (A002275) of length k. A56694
Arises from a social choice theory problem. Sequence is a transformation of the number of non-transitive non-quasitransitive acyclic distinct profiles with 3 alternatives and strict individual preferences. A82678