Properties of the Number 22831

Twenty-Two Thousand Eight Hundred Thirty-One

Basics

Value: 22830 → 22831 → 22832

Parity: odd

Prime: No

Previous Prime: 22817

Next Prime: 22853

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 17 ² × 79

Divisors: 1, 17, 79, 289, 1343, 22831

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101100100101111

Octal: 54457

Duodecimal: 11267

Hexadecimal: 592f

Square: 521254561

Square Root: 151.099305094365

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

The game of Mousetrap with n cards: the number of permutations of n cards having at least one hit after 2. A2468

Numbers n such that the sum of the prime factors of n equals the product of the digits of n. A67173

Starts of runs of 3 consecutive integers whose exponent of least prime factor in their prime factorization is even. A365871

Number of partitions p of n such that (# 1s in p) = (#1s in conjugate(p)). A240691

Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k levels. A level in a bargraph is a maximal sequence of two or more adjacent horizontal steps; it is preceded and followed by either an up step or a down step. A273344

a(0) = 32; then, for n >= 1, a(n) is the smallest positive integer k such that pod(k²)/pod(k) = A002473(n) where pod = product of digits = A007954. A351809

a(n) = n² + 731·n + 1. A180919

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 771", based on the 5-celled von Neumann neighborhood. A273500

[ (4th elementary symmetric function of P(n))/(2nd elementary symmetric function of P(n)) ], where P(n) = {first n+3 primes}. A24456

a(n) = c(1)p(1) + ... + c(n)p(n), where c(i) = 1 if a(i-1) <= p(i) and c(i) = -1 if a(i-1) > p(i), for i = 1,...,n (p(i) = primes). A22831