Properties of the Number -70488

Seventy Thousand Four Hundred Eighty-Eight

Basics

Value: -70489 → -70488 → -70487

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 11 × 89

Divisors: 1, 2, 3, 4, 6, 8, 9, 11, 12, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -10001001101011000

Octal: -211530

Duodecimal: -34960

Hexadecimal: -11358

Square: 4968558144

Square Root: 265.49576267805105

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

Number of ways to partition 2n+1 into distinct positive integers. A78408

a(n) = number of partitions of primes into distinct (also odd) parts. A64688

Sum of all the parts in the partitions of n into 5 parts. A308822

Number of ways to partition 4·n+3 into distinct positive integers. A78410

Practical numbers m with m-1 and m+1 both prime, and prime(m)-1 and prime(m)+1 both practical. A257922

Expansion of q^-1 * (χ(-q) * χ(-q⁹) / χ(-q³)²)⁶ in powers of q where χ() is a Ramanujan θ function. A128512

Averages y of twin prime pairs that satisfy y = x² + x - 2. A214840

Number of length-n binary words having no nontrivial prefix that is a palindrome of odd length. A308528

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (-1, 1, 1), (0, 1, 1), (1, -1, 0)}. A148372

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (-1, 1, 1), (0, 1, 1), (1, -1, 0)}. A148373