Properties of the Number -104400

One Hundred Four Thousand Four Hundred

Basics

Value: -104401 → -104400 → -104399

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 5 ² × 29

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11001011111010000

Octal: -313720

Duodecimal: -50500

Hexadecimal: -197d0

Square: 10899360000

Square Root: 323.10988842807024

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

Let a,b,c,...k be all divisors of n; a(n) = (a+1)*(b+1)*...*(k+1). A20696

Numbers with prime factorization pq^2r^2s⁴. A190319

a(n) is the smallest number m with exactly n divisors whose first digit equals the first digit of m. A357300

Expansion of e.g.f. 1/(1 - x)^log(1 - x). A308346

Coreful triperfect numbers: numbers k such that csigma(k) = 3·k, where csigma(k) is the sum of the coreful divisors of k (A057723). A364990

Exponential abundant numbers that are not exponential unitary abundant. A391085

Exponential Zumkeller numbers that are not exponential unitary Zumkeller numbers. A391090

Numbers containing squares of Pythagorean triples in their divisor set. A96472

Ordered (2,2)-selections from the multiset {1,1,2,2,3,3,...,n,n}. A188667

a(n) is the smallest number m such that gcd(τ(m), σ(m), pod(m)) = n where τ(k) is the number of divisors of k (A000005), σ(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955). A337325