Properties of the Number -42375

Forty-Two Thousand Three Hundred Seventy-Five

Basics

Value: -42376 → -42375 → -42374

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ³ × 113

Divisors: 1, 3, 5, 15, 25, 75, 113, 125, 339, 375

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010010110000111

Octal: -122607

Duodecimal: -20633

Hexadecimal: -a587

Square: 1795640625

Square Root: 205.85188850238902

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 reversed integer partitions y of n with exactly one fixed point y(i) = i. A352832

a(n) = floor(C(n,4)/5). A11795

a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads. A51170

Fermat coefficients. A970

Define the sequence S(a₀,a₁) by a_n+2 is the least integer such that a_n+2/a_n+1>a_n+1/a_n for n >= 0. This is S(3,6). A18909

Numbers k such that the decimal expansion of k² consists of two squares that overlap in 2 digits. A48424

Numbers k = concat(s,t) such that k = (Fibonacci(s) mod k) * (Fibonacci(t) mod k). A272770

a(n) is the cyclic length of the iterative sequence f(k) = prime(f(k-1) mod 2ⁿ) with f(0) = 1. A326613