Properties of the Number -6152

One Hundred Fifty-Two

Basics

Value: -6153 → -6152 → -6151

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 769

Divisors: 1, 2, 4, 8, 769, 1538, 3076, 6152

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100000001000

Octal: -14010

Duodecimal: -3688

Hexadecimal: -1808

Square: 37847104

Square Root: 78.43468620451031

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)=a(2)=1, a(n+2)=a(n+1)+a(n)+(-2)ⁿ. A73845

A129065 with v=x instead of v=1: recursive polynomial coefficient triangle. A136452

Numbers that are the sum of 11 positive 11th powers. A4822

Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts. A379720

Number of partitions of n into >= 2 parts and with minimum part >= 2. A83751

Number of nonagons that can be formed with perimeter n. A288255

Number of polygons formed when every pair of vertices of a row of n adjacent congruent rectangles are joined by an infinite line. A344993

Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}. A110610

Number of partitions of n in which both smallest and largest part occur only once. A117995

T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0. A266455