Properties of the Number -30422

Thirty Thousand Four Hundred Twenty-Two

Basics

Value: -30423 → -30422 → -30421

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 41 × 53

Divisors: 1, 2, 7, 14, 41, 53, 82, 106, 287, 371

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011011010110

Octal: -73326

Duodecimal: -15732

Hexadecimal: -76d6

Square: 925498084

Square Root: 174.4190356583822

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) is the smallest b > 1 such that p = prime(n) satisfies b^p-1 == 1 (mod p³). A249275

Triangle read by rows: coefficients of the polynomials A_3,4(n,k). A245173

Number of partitions of n with exactly four part sizes. A365630

a(0) = 1, a(n) = 20·n² + 2 for n>0. A10010

Numbers n such that (i) the largest prime factor of n is not a palindrome and (ii) the sum of the factorials of the digits of n is equal to the largest prime factor of n reversed. A74301

Let f(k) denote the largest prime factor of k which is not a palindrome. Sequence gives numbers k such that the sum of the factorials of the digits of k is equal to f(k) reversed. A111185

Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^t+u+v) having two, four, five, six or seven distinct values for every i,j,k<=n. A211743