Properties of the Number -33062

Thirty-Three Thousand Sixty-Two

Basics

Value: -33063 → -33062 → -33061

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 61 × 271

Divisors: 1, 2, 61, 122, 271, 542, 16531, 33062

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1000000100100110

Octal: -100446

Duodecimal: -17172

Hexadecimal: -8126

Square: 1093095844

Square Root: 181.82959055115313

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

Numbers that are the sum of 7 nonzero 8th powers. A3385

Number of ordered rooted trees with n edges having root of odd degree. A958

a(n) = ∑_{k=0..floor(n/2)} (k+1) * binomial(k,2*(n-2·k)). A392251

Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k. A65602

Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k even-length branches starting at the root (0<=k<=n). A127541

Triangle read by rows: Catalan triangle of the k-Fibonacci sequence. A236918

a(n) = ∑_k=0..n (k+1) * binomial(k,4*(n-k)). A392076

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having exactly k UDU's at low level. A98747

Convolution triangle of A000958(n+1). A237596