Properties of the Number 3150

Three Thousand One Hundred Fifty

Basics

Value: 3149 → 3150 → 3151

Parity: even

Prime: No

Previous Prime: 3137

Next Prime: 3163

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 ² × 7

Divisors: 1, 2, 3, 5, 6, 7, 9, 10, 14, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110001001110

Octal: 6116

Duodecimal: 19A6

Hexadecimal: c4e

Square: 9922500

Square Root: 56.124860801609124

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

Primorial base exp-function: digits in primorial base representation of n become the exponents of successive prime factors whose product a(n) is. A276086

a(n) = n³ - n². A45991

T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows. A63007

Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). A100861

Triangle of coefficients of Bessel polynomials (exponents in decreasing order). A1497

Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order). A1498

Factorial base exp-function: digits in factorial base representation of n become the exponents of successive prime factors whose product a(n) is. A276076

Triangle of Bessel numbers read by rows. Row n gives T(n,n), T(n,n-1), T(n,n-2), ..., T(n,1) for n >= 1. A111924

Sums of distinct powers of 5. A33042

a(n) = (3·n² - n - 2)/2. A115067