Properties of the Number -74879

Seventy-Four Thousand Eight Hundred Seventy-Nine

Basics

Value: -74880 → -74879 → -74878

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 7 × 19 × 563

Divisors: 1, 7, 19, 133, 563, 3941, 10697, 74879

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10010010001111111

Octal: -222177

Duodecimal: -373BB

Hexadecimal: -1247f

Square: 5606864641

Square Root: 273.64027481348575

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

From fundamental unit of Z[ (-d)^1/4 ], where d runs over positive integers not of the form 4·k⁴. A6828

Smallest number k such that n! - k is a square. A66857

The distance between n! and the nearest perfect square. A260374

Start to read the sequence digit by digit and erase the first "1" you encounter, then the first "2", the first "3", etc., until the first "9"; go on from there and erase again the first "1", the first "2", etc., until "9" -- and so on, cyclically until the end of the (infinite) sequence. Concatenate what is left. The result is the concatenation of all integers of the sequence. A108709

a(n) = 3n³ + 2n² + n + 1. A130884

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306. A25110

Least number k >= 0 such that n! - k is a perfect power. A240940