Properties of the Number -34151

Thirty-Four Thousand One Hundred Fifty-One

Basics

Value: -34152 → -34151 → -34150

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 13 × 37 × 71

Divisors: 1, 13, 37, 71, 481, 923, 2627, 34151

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000010101100111

Octal: -102547

Duodecimal: -1791B

Hexadecimal: -8567

Square: 1166290801

Square Root: 184.79989177486007

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

T(n,k) = number of n X k 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X (k+1) 0..2 array without adjacent equal elements in the latter. A229521

Principal diagonal of the convolution array A213771. A213772

a(n) = ∑_i=0..n digsum₅(i)⁴, where digsum₅(i) = A053824(i). A231671

a(n) = 25·n² - 2·n. A154376

Number of unlabeled rooted trees with n nodes such that every branch of the root has the same number of nodes. A298537

Numbers k such that j(k)*φ(k) = σ(φ(k)), j(k) = A033831(k). A33856

Least multiple of 2n-1 ending in prime(n), 0 if no such number exists. A114780

Number of n X 4 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X 5 0..2 array without adjacent equal elements in the latter. A229517

Number of n X n 0..2 arrays of the median of the corresponding element, the element to the east and the element to the south in a larger (n+1) X (n+1) 0..2 array without adjacent equal elements in the latter. A229513