Properties of the Number 31351

Thirty-One Thousand Three Hundred Fifty-One

Basics

Value: 31350 → 31351 → 31352

Parity: odd

Prime: No

Previous Prime: 31337

Next Prime: 31357

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 107 × 293

Divisors: 1, 107, 293, 31351

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101001110111

Octal: 75167

Duodecimal: 16187

Hexadecimal: 7a77

Square: 982885201

Square Root: 177.06213598621247

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(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 3. A50035

The array in A059219 read by antidiagonals in 'up' direction. A59220

The array in A059219 read by antidiagonals in the direction in which it was constructed. A59235

Numbers n such that sigma₃(n) is divisible by square of cototient of n, while n is not a prime number. A91286

Number of (n+3) X 9 0..2 matrices with each 4 X 4 subblock idempotent. A224726

a(n) is the least k such that A033273(k) is equal to (A033273(n·k + 1) - 1)/n where A033273(n) is the number of nonprime divisors of n. A352256

T(n,k)=Number of (n+3)X(k+3) 0..2 matrices with each 4X4 subblock idempotent. A224728

5-multiplicative persistence: number of iterations of "multiply 5th powers of digits" needed to reach 0 or 1. A31351

a(n) is the smallest b > 1 such that bⁿ - (b-1)ⁿ has all divisors d == 1 (mod n). A321576