Properties of the Number -75973

Seventy-Five Thousand Nine Hundred Seventy-Three

Basics

Value: -75974 → -75973 → -75972

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 17 × 41 × 109

Divisors: 1, 17, 41, 109, 697, 1853, 4469, 75973

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10010100011000101

Octal: -224305

Duodecimal: -37B71

Hexadecimal: -128c5

Square: 5771896729

Square Root: 275.6320010448714

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) = 2·n*a(n-1) + 1 with a(0) = 1. A10844

Triangle read by rows: T(n, k) = n! * 2^k * hypergeom([-k], [-n], 1/2). A374428

Square array, read by antidiagonals: form the Euler-Seidel matrix for the sequence {2^k*k!} and then divide column k by 2^k*k!. A143411

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of the e.g.f. exp(x)/(1 - k·x). A320031

Numbers k such that φ(6k) is either φ(6k-2) or φ(6k+2), where φ is Euler's totient function A000010. A279011

Numbers k such that φ(6k) = φ(6k+2), where φ is Euler's totient function A000010. A279184

Triangle read by rows: T(n,k) = 2·k*T(n-1,n-1) + 1 (n >= 0, 0 <= k <= n), with T(0,0) = 1. A161380

Numbers n such that φ(n) = φ(3n+1). A91294