Properties of the Number -7557

Five Hundred Fifty-Seven

Basics

Value: -7558 → -7557 → -7556

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: Yes

Factorization: 3 × 11 × 229

Divisors: 1, 3, 11, 33, 229, 687, 2519, 7557

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1110110000101

Octal: -16605

Duodecimal: -4459

Hexadecimal: -1d85

Square: 57108249

Square Root: 86.93100712634129

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) = n*(7·n-2). A135703

Palindromes with exactly 3 prime factors (counted with multiplicity). A46329

Sum of the first n palindromes (A002113). A46489

Triangle read by rows: T(n,g) = number of general immersions of a circle with n crossings in a surface of arbitrary genus g (the circle is not oriented, the surface is not oriented). A260914

Numbers k with digits 5 and 7 only. A284380

a(n) is the minimal area of a convex lattice polygon with 2n sides. A89187

a(n) is the decimal expansion of 7nn7. A100897

Base-10 palindromes that start with 7. A43042

Odd palindromes with an even number of digits. A132285

Auxiliary c(n) sequence used to prove some properties about Rowland's sequence. c(n) has the following recursive definition: c(1) = 5, c_n+1 = c(n) + lfp(c(n)) - 1, where lpf(.) denotes the lowest prime factor of a number. A190894