Properties of the Number 27175

Twenty-Seven Thousand One Hundred Seventy-Five

Basics

Value: 27174 → 27175 → 27176

Parity: odd

Prime: No

Previous Prime: 27143

Next Prime: 27179

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 ² × 1087

Divisors: 1, 5, 25, 1087, 5435, 27175

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110101000100111

Octal: 65047

Duodecimal: 13887

Hexadecimal: 6a27

Square: 738480625

Square Root: 164.84841521834537

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

Numbers k such that k divides the number of digits of k!. A58814

Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))²) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))² - y). A219963

Number of nX4 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301880

Smallest number k such that floor[(the number of digits in k!) / k] is greater than any j < k. A36841

E.g.f. A(x) satisfies: [xⁿ] A(x)^n² = n² * [x^n-1] A(x)^n² for n>=1. A300590

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero. A301884

Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k·n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph. A392261

a(n) = A027170(2n-1, n-1). A27175