Properties of the Number 31392

Thirty-One Thousand Three Hundred Ninety-Two

Basics

Value: 31391 → 31392 → 31393

Parity: even

Prime: No

Previous Prime: 31391

Next Prime: 31393

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁵ × 3 ² × 109

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101010100000

Octal: 75240

Duodecimal: 16200

Hexadecimal: 7aa0

Square: 985457664

Square Root: 177.17787672280082

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

Number of partitions of n into parts not of the form 13k, 13k+5 or 13k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 5 are greater than 1. A35953

Triangle: self-converse semigroups of order n with k idempotents. A58118

Expansion of f(q)*f(q⁷)/(f(-q)*f(-q⁷)) in powers of q where f() is a Ramanujan θ function. A123862

Indices of records in A360519. A361108

Index where n first appears in A381597. A381599

Numbers k such that φ(k) = bigomega(k)*τ(k)². A68540

Average of twin prime pairs with multiple and strictly distinct powers. A177426

Triangle read by rows: T(n,k) is the number of rooted maps with n edges whose core comprises k edges, 1 <= k <= n. A318106

a(n) is the number of 3-regular 3-hypergraphs on n labeled vertices. (In a 3-hypergraph, each hyper-edge is a proper 3-set; 3-regular implies that each vertex is in exactly 3 hyperedges.) A110101

a(n) = prime(5·n-4). A31392