Properties of the Number -30239

Thirty Thousand Two Hundred Thirty-Nine

Basics

Value: -30240 → -30239 → -30238

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 11 × 2749

Divisors: 1, 11, 2749, 30239

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111011000011111

Octal: -73037

Duodecimal: -155BB

Hexadecimal: -761f

Square: 914397121

Square Root: 173.8936456573385

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

Expansion of e.g.f. exp(x * (1 + x⁴)^1/4). A373524

Smallest number requiring n terms to be expressed as a sum of factorials. A200748

Number of permutations of (1,...,n) having n-2 inversions (n>=2). A1892

a(n) is least N > 1 congruent to -1,0, or 1 mod i for all i=1,...,n. A56697

a(n) = 6·n! - 1. A173316

Number of "ON" cells at n-th stage of three-dimensional version of the cellular automaton A160414 using cubes. A161340

Pseudo-random numbers: Davenport's generator for 32-bit integers. A84277

a(n) = smallest m such that A187824(m) = n, or -1 if A187824 never takes the value n. A220890

Where record values occur in A187824. A220891

Triangle T(n,k) giving the largest member of "the infinite trunk of factorial beanstalk" (A219666) whose factorial base representation contains n digits (A084558) and the most significant such digit (A099563) is k. A230429