Properties of the Number 14990

Fourteen Thousand Nine Hundred Ninety

Basics

Value: 14989 → 14990 → 14991

Parity: even

Prime: No

Previous Prime: 14983

Next Prime: 15013

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 1499

Divisors: 1, 2, 5, 10, 1499, 2998, 7495, 14990

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101010001110

Octal: 35216

Duodecimal: 8812

Hexadecimal: 3a8e

Square: 224700100

Square Root: 122.43365550370535

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

Sorted positions of first appearances in A057820, the sequence of first differences of prime-powers. A376340

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two, and every 2X2 determinant nonzero. A206318

Number of surviving Collatz residues mod 2ⁿ. A76227

Number of factorizations of n! into factors > 1 that can be obtained by taking the block-products of some set partition of {2,3,...,n}. A321467

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

Triangle read by rows: T(n,k) is the number of permutations p of [n] for which k is the smallest among the positive differences p(i+1) - p(i); k=0 for the reversal of the identity permutation (0<=k<=n-1). A180190

Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes. A59677

a(n) is least k such that k and 8k are anagrams in base n (written in base 10). A23100

Sums of three consecutive heptagonal numbers. A129111

Number of rhombuses on a (n+1)X9 grid. A190097