Properties of the Number -128257

One Hundred Twenty-Eight Thousand Two Hundred Fifty-Seven

Basics

Value: -128258 → -128257 → -128256

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 128257

Divisors: 1, 128257

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -11111010100000001

Octal: -372401

Duodecimal: -62281

Hexadecimal: -1f501

Square: 16449858049

Square Root: 358.12986471390514

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

Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = ∑_i=1..8 a(n-i). A79262

Number of non-alternating compositions of n, excluding twins (x,x). A348377

Primes equal to a centered pentagonal number plus 1. A285810

a(n) is the number of n-tosses having a run of 6 or more heads for a fair coin (i.e., probability is a(n)/2ⁿ). A143662

Consider a number of k digits n = d_k*10^k-1 + d_k-1*10^k-2 + … + d₂*10 + d₁. Sequence lists the numbers n such that ∑_i=1..k-1{σ(∑_j=1..i{d_j*10^j-1})} = ∑_i=1..k-1{φ(∑_j=1..i{d_k-j+1*10^i-j})} (see example below). A244068

Sequence defined by a(1)=a(2)=1 and a(n) = gray(gray(a(n-1)) + gray(a(n-2))), with gray(m) = A003188(m). A265386

Primes in the union of all n-Fibonacci sequences. A227880

Numbers that are both lucky-indexed primes and prime-indexed lucky numbers. A307009

Primes in the 8th-order Fibonacci numbers A079262. A253706

Primes that belong to A156781, A156782 and A156783. A156785