Properties of the Number 2195

Two Thousand One Hundred Ninety-Five

Basics

Value: 2194 → 2195 → 2196

Parity: odd

Prime: No

Previous Prime: 2179

Next Prime: 2203

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 439

Divisors: 1, 5, 439, 2195

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 100010010011

Octal: 4223

Duodecimal: 132B

Hexadecimal: 893

Square: 4818025

Square Root: 46.850827100489916

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

Jablonski table T(n,k) read by antidiagonals: T(n,k) = number of necklaces with n beads of k colors. A75195

Numbers that are the sum of 11 positive 6th powers. A3367

Numbers that are the sum of 9 positive 7th powers. A3376

Number of n-bead necklaces with 3 colors. A1867

Number of strict partitions of n such that (least part) > number of parts. A237979

T(n,k) is the number of strings of numbers x(i=1..n) in 0..k with sum i²*x(i) equal to k·n². A183953

Number of divisors of n! with equal prime multiplicities. A336415

G.f.: A(x) = exp( ∑_n>=1 σ(n²)*xⁿ/n ), a power series in·with integer coefficients. A156303

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (j+5)*prime(j)*T(n-2, k-1) with j=6, read by rows. A153651

Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..2 arrays. A184284