ℕ atory
Play Now

Properties of the Number -22151

Twenty-Two Thousand One Hundred Fifty-One

Basics

Value: -22152 → -22151 → -22150

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 17 × 1303

Divisors: 1, 17, 1303, 22151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101011010000111

Octal: -53207

Duodecimal: -1099B

Hexadecimal: -5687

Square: 490666801

Square Root: 148.8321201891581

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

Centered octahedral numbers (crystal ball sequence for cubic lattice). A1845
Number of partitions of n having no parts with multiplicity 5. A184640
Asymmetric rhythm cycles (patterns): binary necklaces of length 2n subject to the restriction that for any k if the k-th bead is of color 1 then the (k+n)-th bead (modulo 2n) is of color 0. A115114
Odd numbers n for which 17 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1. A112077
Number of n-th generation nodes of a rooted binary tree whose m-th node has exactly A000002(m) descendants, where A000002 is the Kolakoski sequence. A329758
Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right). A61976
Number of imprimitive (periodic) asymmetric rhythm cycles: ones having nontrivial shift automorphisms. Asymmetric rhythm cycles (A115114): binary necklaces of length 2n subject to the restriction that for any k if the k-th bead is of color 1 then the (k+n)-th bead (modulo 2n) is of color 0. A115116
Numbers k such that replacing each digit d in the decimal expansion of k with d3 yields a prime each time, when done recursively three times. A316982
Trajectory of 1 under map n->13n+1 if n odd, n->n/2 if n even. A33964
Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1. A71392