Properties of the Number -30470

Thirty Thousand Four Hundred Seventy

Basics

Value: -30471 → -30470 → -30469

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 11 × 277

Divisors: 1, 2, 5, 10, 11, 22, 55, 110, 277, 554

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111011100000110

Octal: -73406

Duodecimal: -15772

Hexadecimal: -7706

Square: 928420900

Square Root: 174.55658108475888

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

7th column of the array A172119. A172316

Expansion of g.f. 1/ (1-x¹*(1-x^m+1)/ (1-x²*(1-x^m+2)/ (1- ... ))) for m=7. A228644

Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are in (weakly) increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A321296

Number of colored set partitions of [2n] where colors of the elements of subsets are in (weakly) increasing order and exactly n colors are used. A325889

Intersection of A108027, A108028, A108029 and A108030. A108109

Number of ways of having a total of n coins in your two pockets (each of them either a penny, a nickel, a dime, or a quarter), so that the amounts in the pockets are identical. A323825

Let p(k) be the number of partitions of k (A000041); a(n) = ∑_{1<=k<=n, gcd(k,n)=1} p(k). A96223