Properties of the Number 27169

Twenty-Seven Thousand One Hundred Sixty-Nine

Basics

Value: 27168 → 27169 → 27170

Parity: odd

Prime: No

Previous Prime: 27143

Next Prime: 27179

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 101 × 269

Divisors: 1, 101, 269, 27169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101000100001

Octal: 65041

Duodecimal: 13881

Hexadecimal: 6a21

Square: 738154561

Square Root: 164.83021567661677

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

Max_k=0..n { Number of partitions of n into exactly k parts }. A2569

MM-numbers of crossing set partitions. A324324

Number of partitions of n into at most 11 parts. A8640

Molien series for A₁₁. A8634

a(n) is the number of primes q <= A080082(n) such that prime(n) divides q + 1. A390840

Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1. A35988

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 141", based on the 5-celled von Neumann neighborhood. A270284

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (1, -1, 1), (1, 0, -1), (1, 1, 1)}. A149720

a(n) = self-convolution of row n of array T given by A027157. A27169