Properties of the Number -11433

Eleven Thousand Four Hundred Thirty-Three

Basics

Value: -11434 → -11433 → -11432

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 37 × 103

Divisors: 1, 3, 37, 103, 111, 309, 3811, 11433

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10110010101001

Octal: -26251

Duodecimal: -6749

Hexadecimal: -2ca9

Square: 130713489

Square Root: 106.92520750505935

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 read by rows: T(n,k) is the number of n-node connected unsensed planar maps with an external face and k triangular internal faces, n >= 3, 1 <= k <= 2·n - 5. A378103

a(n) = 104·n + 9977. A126978

Numbers of the form m = p1·p2·p3 where for each d∣m we have (d+m/d)/2 prime and p1 < p2 < p3 each prime. A128284

Expansion of sum ( qⁿ / product( 1-q^k, k=1..5·n), n=0..inf ). A35297

Sum of digits of square is sum of square of digits. A165550

A Catalan-like sequence formed from the row sums of a Catalan-like triangle where row n is truncated to have ceiling((n+4)*log(3)/log(2)) - (n + 6) terms. A374244

Quasi-Carmichael numbers to base -7: squarefree composites n such that prime p∣n ==> p+7∣n+7. A29567

a(0) = 1; a(n) = (11·n² - 9·n + 4)/2 for n>0. A389625

Fibonacci sequence with a(1) = 7 and a(2) = 26. A98127

Number of Motzkin meanders of length n with an even number of humps and without peaks. A325917