Properties of the Number -6145

One Hundred Forty-Five

Basics

Value: -6146 → -6145 → -6144

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 5 × 1229

Divisors: 1, 5, 1229, 6145

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100000000001

Octal: -14001

Duodecimal: -3681

Hexadecimal: -1801

Square: 37761025

Square Root: 78.39005038906404

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) = 3·2ⁿ + 1. A181565

Numbers that are the sum of 7 positive 10th powers. A4807

Numbers that are the sum of 4 positive 11th powers. A4815

1/4 the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences. A209721

a(0) = 1; thereafter a(n) = 3·2^n-1 + 1. A4119

a(n) = coefficient of xⁿ, n >= 0, in A(x) such that: 1 = ∑_n=-oo..+oo xⁿ * (2·A(x) - xⁿ)^n-1. A357227

Frequency of the hexadecimal F in the first 10ⁿ hexadecimal digits of π. A99348

Square array read by descending antidiagonals: T(n, k) where column k is the expansion of 1/sqrt(1 - 2*(k+1)*x + ((k-1)*x)²). A307883

Pascal-(1,5,1) array. A81580

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50028