Properties of the Number 27052

Twenty-Seven Thousand Fifty-Two

Basics

Value: 27051 → 27052 → 27053

Parity: even

Prime: No

Previous Prime: 27043

Next Prime: 27059

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 6763

Divisors: 1, 2, 4, 6763, 13526, 27052

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100110101100

Octal: 64654

Duodecimal: 137A4

Hexadecimal: 69ac

Square: 731810704

Square Root: 164.47492210060474

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

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 1. A49918

Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0. A96554

Sum of digits of n-th even superperfect number A061652(n). A138827

Triangular array T read by rows: T(n,0) = T(n,2n) = 1 for n >= 0, T(n,1)=0 for n >= 1, T(n,2)=1 for n >= 2 and for n >= 3, T(n,k) = T(n-1,k-3) + T(n-1, k-2) + T(n-1,k-1) for 3 <= k <= 2n-1. T(n,k)=0 for k < 0 or k > 2n. A27052

Number of n X 4 0..1 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 5 0..1 array. A228982

Number of nonequivalent (mod D₈) ways to place 4 points on an n X n point grid so that no point is equally distant from two other points on the same row or the same column. A296999