Properties of the Number -23133

Twenty-Three Thousand One Hundred Thirty-Three

Basics

Value: -23134 → -23133 → -23132

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 × 701

Divisors: 1, 3, 11, 33, 701, 2103, 7711, 23133

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -101101001011101

Octal: -55135

Duodecimal: -11479

Hexadecimal: -5a5d

Square: 535135689

Square Root: 152.09536482089123

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 4-ary Lyndon words whose trace and subtrace are both 0 mod 4. A68596

Number of 4-ary Lyndon words of length n over Z₄ with trace 1 and subtrace 3. A74409

Number of 4-ary Lyndon words of length n over Z₄ with trace 2 and subtrace 0. A74410

a(n) = T(2n-1,n-1), T given by A026758. Also T(2n+1,n+1), T given by A026747. A26762

a(n) = T(n, floor(n/2)), T given by A026758. A26764

Number T(n,k) of parts in all proper k-times partitions of n; triangle T(n,k), n >= 1, 0 <= k <= n-1, read by rows. A327631

T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k·n such that x(j) divides x(k) if j divides k. A180383

Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5·n such that x(j) divides x(k) if j divides k. A180387

Greatest number in row n of array T given by A026758. A27230