ℕ atory
Play Now

Properties of the Number 22890

Twenty-Two Thousand Eight Hundred Ninety

Basics

Value: 22889 → 22890 → 22891

Parity: even

Prime: No

Previous Prime: 22877

Next Prime: 22901

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 109

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101100101101010

Octal: 54552

Duodecimal: 112B6

Hexadecimal: 596a

Square: 523952100

Square Root: 151.2944149663166

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 {1,..,n} into lists with an even number of lists of size 1, where a list means an ordered subset (cf. A000262). A111752
Numbers k such that the first 9 decimal digits of the k-th Fibonacci number is 1-9 pandigital. A112516
Number of cyclic permutations of length n avoiding the pattern 231 (equivalently, 312). A309506
Number of (w,x,y,z) with all terms in {1,...,n} and |x-y|<|y-z|. A212681
a(n) is the least number k such that the number of distinct digits in the prime factorization of k is n (counting terms of the form p1 as p). A254317
Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)). A132883
a(n) = primorial(n) mod n!. A182254
Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 246", based on the 5-celled von Neumann neighborhood. A271010
Numbers whose base-4 representation contains exactly four 1's and four 2's. A45109
Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)). A114711