Properties of the Number -134043

One Hundred Thirty-Four Thousand Forty-Three

Basics

Value: -134044 → -134043 → -134042

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 13 × 491

Divisors: 1, 3, 7, 13, 21, 39, 91, 273, 491, 1473

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100000101110011011

Octal: -405633

Duodecimal: -656A3

Hexadecimal: -20b9b

Square: 17967525849

Square Root: 366.11883316759327

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

a(n) is the first term in the first chain of at least n consecutive numbers each having exactly four distinct prime factors. A87977

Initial term of first run of exactly n consecutive numbers with 4 distinct prime factors. A185042

a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists. A75044

a(n) = T(n,[ n/2 ]), where T is the array defined in A024996. A26078

Smallest numbers k such that 2^k-1 when written in ternary contains its least significant zero in position n. A391268

T(2n,n), where T is the array defined in A024996. A26073

Smallest number k such that ω(k)+ ω(k+1)+ ω(k+2)+ ω(k+3)= n. A175206

Square array T(n, k), n > 1 and k >= 1, read by upward antidiagonals, give the smallest number that starts a sequence of exactly k consecutive numbers, each having exactly n distinct prime factors (counted without multiplicity), or -1 if no such number exists. A375287