Properties of the Number -14900

Fourteen Thousand Nine Hundred

Basics

Value: -14901 → -14900 → -14899

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 ² × 149

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 100, 149

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101000110100

Octal: -35064

Duodecimal: -8758

Hexadecimal: -3a34

Square: 222010000

Square Root: 122.06555615733703

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

a(n) = ∑_t=0..n g(t)*g(n-t) where g(t) = A002121(t). A2122

Numbers k such that 2 is the largest decimal digit of k². A277959

a(n) = ∑_{1 <= i, j <= n} gcd(i, j, n)³. A368743

Number of multisets of nonempty words with a total of n letters over n-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A292713

a(n) = n*(19·n-15)/2. A226490

Practical numbers z such that z² = x² + y² for some practical numbers·and y with gcd(x,y,z) = 4. A294112

a(0) = 0, a(1) = 1, a(n+1) = 5*(2·n+1)*a(n) + n⁴*a(n-1). A143001

Number of partitions p of n such that max(p)-min(p) = 9. A218572

Numbers k such that sum of digits of k² is 7. A262711

Consider the triangle in which the j-th row begins with prime(j) and is the arithmetic progression with least common difference such that the remaining j-1 terms are composite and not divisible by prime(j). Sequence gives last term in each row. A95182