Properties of the Number -12147

Twelve Thousand One Hundred Forty-Seven

Basics

Value: -12148 → -12147 → -12146

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 4049

Divisors: 1, 3, 4049, 12147

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10111101110011

Octal: -27563

Duodecimal: -7043

Hexadecimal: -2f73

Square: 147549609

Square Root: 110.21342930877344

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(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n. A2123

Let f(n)=Floor[Mod[10^k*(7/(4·k + 1) - 6/(4·k + 3) - 1/(4·k + 5)), 3]]; M0 = {{0, 1}, {1, 1/2}}; M = {{0, 2}, {2, 1}}; as Mh=M0.M.(M0+I·f[n]); v[(n)=Mh.v(n-1), then a(n) is the first element of v. A152270

Expansion of g.f. x*(1-3·x-8·x²)/(1+5·x²-32·x⁴). A152269

Powers of cube root of 13 rounded to nearest integer. A18013

Powers of cube root of 13 rounded up. A18014

a(n) = least k such that the remainder when 23^k is divided by k is n. A128363

Number of maximal product-free subsets of {1..n}. A326496

a(n) = A289671(n)/2^f(n), where f(n) = 2·floor((n-1)/3) + ((n+2) mod 3) = A004523(n). A289677

Expansion of ∏_k>=1 (1 + 2·x^k)/(1 - x^k). A264686

Number of integer partitions of n with some part that can be written as a nonnegative linear combination of the other distinct parts. A365068