Properties of the Number -99330

Ninety-Nine Thousand Three Hundred Thirty

Basics

Value: -99331 → -99330 → -99329

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 11 × 43

Divisors: 1, 2, 3, 5, 6, 7, 10, 11, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000010000000010

Octal: -302002

Duodecimal: -49596

Hexadecimal: -18402

Square: 9866448900

Square Root: 315.16662259826944

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

Products of exactly 6 distinct primes. A67885

Least number k such that all coefficients of k·B(n,x), the n-th Bernoulli polynomial, are integers. A144845

a(n) is the smallest positive integer such that a(n)*(1ⁿ + 2ⁿ + ... + xⁿ) is a polynomial in·with integer coefficients. A64538

Numbers with six distinct prime divisors. A74969

Numbers k such that usigma(k) >= 3·k, where usigma(k) = sum of unitary divisors of k (A034448). A285615

Denominators of z-sequence for the Sheffer matrix (triangle) A094816 (coefficients of Poisson-Charlier polynomials). A130190

Product of sexagesimal digits of Fibonacci numbers in base-60 representation. A261598

Expansion of 30·x*(1 + x) / (1 - x)⁴. A316459

Let ω(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that ω(n) > ω(j) for all j < n. A74112

Largest n-digit number with maximal number of distinct prime divisors. A91800