Properties of the Number 27732

Twenty-Seven Thousand Seven Hundred Thirty-Two

Basics

Value: 27731 → 27732 → 27733

Parity: even

Prime: No

Previous Prime: 27701

Next Prime: 27733

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 2311

Divisors: 1, 2, 3, 4, 6, 12, 2311, 4622, 6933, 9244

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110001010100

Octal: 66124

Duodecimal: 14070

Hexadecimal: 6c54

Square: 769063824

Square Root: 166.5292767053289

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) = minimal m such that m>n, n divides m, n-1 divides m-1, n-2 divides m-2 and so on down to 1 divides m-n+1. A60401

Number of fixed n-polyominoids, allowing both corner- and edge-connections. A365651

Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A130369/A130370. A130378

Self-composition of the number of divisors function (A000005). A307305

Expansion of (1+x) / (1-x-4·x²+2·x³). A384605

Sums of 2 successive primes s = prime(m) + prime(m+1) such that all digits of s are primes. A173719

Smallest integer m greater than n such that m (mod k) == n (mod k) for k = 1..n-1. A195507

Numbers k such that (k+j) mod (2+j) = 1 for j from 0 to 10 and (k+11) mod 13 <> 1. A96027

G.f. satisfies: A(x) = x + A(A(A(A(x)))²). A141382

Number of independent subsets of nodes in graph formed from n-fold subdivision of 5-dimensional simplex. A27732