Properties of the Number -16950

Sixteen Thousand Nine Hundred Fifty

Basics

Value: -16951 → -16950 → -16949

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 ² × 113

Divisors: 1, 2, 3, 5, 6, 10, 15, 25, 30, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100001000110110

Octal: -41066

Duodecimal: -9986

Hexadecimal: -4236

Square: 287302500

Square Root: 130.19216566291536

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 n such that if p=prime(n), then p, p+6, p+12, p+18 are consecutive primes with p=6·k+5 for some k, where prime(n) denotes n-th prime. A90835

Coordination sequence for {A₄}* lattice. A8531

Partial sums of A038580. A86749

a(n) = 27·n² - 51·n + 24, n>=1. A304836

a(n) = ∑_{1 <= x₁, x₂, x₃ <= n} σ( ( n/gcd(x₁, x₂, x₃, n) )² ). A373131

a(n) = (n+2)*(n+1)*(n² + 7·n - 12)/24. A14309

Number of partitions of n into parts whose bitwise AND equals 0. A307435

Number T(n,k) of partitions of [n] for which the difference between the longest and the shortest block size is k; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows. A364971

a(n) = 2*(2n-1)!!-(n-1)!*2^n-1, where (2n-1)!! is A001147(n). A779

Number of protruded partitions of n with largest part at most 3. A5404