Properties of the Number -301064

Three Hundred One Thousand Sixty-Four

Basics

Value: -301065 → -301064 → -301063

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 37633

Divisors: 1, 2, 4, 8, 37633, 75266, 150532, 301064

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1001001100000001000

Octal: -1114010

Duodecimal: -126288

Hexadecimal: -49808

Square: 90639532096

Square Root: 548.692992483046

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

Exponential generating function x·exp(x/(1-x)). A6152

Exponential Riordan array [e^x/(1-x),x]. A129652

Triangular array read by rows. T(n,k) is the number of partial permutations (injective partial functions) of {1,2,...,n} that have exactly k elements in a cycle. The k elements are not necessarily in the same cycle. A fixed point is considered to be in a cycle. A206703

Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows. A320264

a(n) = ∑_k=0..n (k+1) * A026670(n, k). A26985