Properties of the Number -11431

Eleven Thousand Four Hundred Thirty-One

Basics

Value: -11432 → -11431 → -11430

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 23 × 71

Divisors: 1, 7, 23, 71, 161, 497, 1633, 11431

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110010100111

Octal: -26247

Duodecimal: -6747

Hexadecimal: -2ca7

Square: 130667761

Square Root: 106.91585476438937

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

Triangle t(n,m)= binomial(n+m-1,n-1) + binomial(2·n-m-1,n-1) -binomial(2·n-1,n-1) read by rows, 0<=m<=n. A174952

Number of length n word structures with all distinct run-lengths using an infinite alphabet. A351638

Number of partitions p of n such that the number of parts is a part and max(p) - min(p) is not a part. A241384

Number of n-node rooted trees of height at most 7. A34824

a(n) is the smallest index m such that ∑_k=2..m 1/PrimePi(k) >= n, where PrimePi()=A000720(). A74633

Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k. A36260

Smallest positive integer k (or 0 if no such k) with a primitive cycle of positive integers, exactly n of which are odd, under iteration by the Collatz-like 3x-k function. A226677

Numbers m such that A132575(m) = A132575(m-1). A132580

Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime. A245209

Numbers whose sum of divisors is equal to the product of the number of divisors of their k first powers, for some k. A283758