Properties of the Number 1955

One Thousand Nine Hundred Fifty-Five

Basics

Value: 1954 → 1955 → 1956

Parity: odd

Prime: No

Previous Prime: 1951

Next Prime: 1973

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 17 × 23

Divisors: 1, 5, 17, 23, 85, 115, 391, 1955

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11110100011

Octal: 3643

Duodecimal: 116B

Hexadecimal: 7a3

Square: 3822025

Square Root: 44.21538193886829

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

Number of partitions of n minus number of divisors of n. A144300

Number of partitions of n into distinct parts (a₁, a₂, ... , a_m) (a₁ > a₂ > ... > a_m and ∑_k=1..m a_k = n) such that a1 - a2, a2 - a3, ..., a_m-1 - a_m are different. A320347

Number A(n,k) of semistandard Young tableaux over all partitions of n with maximal element <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A210391

Numbers that when divided by the sum of their digits leave 15 as remainder. A341182

a(n) = n*(3·n + 13)/2. A140672

Number of integer partitions of n with (1) as many odd parts as odd conjugate parts and (2) as many even parts as even conjugate parts. A351976

Number of integer partitions of n whose run-sums are not all equal. A382076

Compound filter (prime signature & sum of the divisors): a(n) = P(A046523(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function. A286360

Number T(n,k) of Dyck paths of semilength n such that the maximal number of peaks per level equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A287822

a(n) = n + (n-1)² + (n+1)². A96376