Properties of the Number 26932

Twenty-Six Thousand Nine Hundred Thirty-Two

Basics

Value: 26931 → 26932 → 26933

Parity: even

Prime: No

Previous Prime: 26927

Next Prime: 26947

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 6733

Divisors: 1, 2, 4, 6733, 13466, 26932

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110100100110100

Octal: 64464

Duodecimal: 13704

Hexadecimal: 6934

Square: 725332624

Square Root: 164.1097193952875

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

T(n,k)=Number of -k..k arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences. A200204

Inverse Euler transform of n². A316152

Number of nonprime parts in the last section of the set of partitions of n. A144121

Number of -7..7 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences. A200203

Number of -n..n arrays x(0..4) of 5 elements with zero sum and nonzero second and third differences. A200206

Inverse Weigh transform of n². A316150

Number of compositions (c1, c2, ...) of n with each c_i <= φ*c_i-1, where φ = (1 + sqrt(5))/2 = A001622. A393207

Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k. A26932