Properties of the Number 4955

Four Thousand Nine Hundred Fifty-Five

Basics

Value: 4954 → 4955 → 4956

Parity: odd

Prime: No

Previous Prime: 4951

Next Prime: 4957

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 991

Divisors: 1, 5, 991, 4955

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001101011011

Octal: 11533

Duodecimal: 2A4B

Hexadecimal: 135b

Square: 24552025

Square Root: 70.39176088151227

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

Irregular triangle read by rows where T(n,k) is the number of labeled loop-graphs covering n vertices with k edges. A369199

Numbers that are the sum of 6 positive 6th powers. A3362

Number of different equations that can be made by summing numbers from 1 to n and using every number not more than once. A161943

Number T(n,k) of compositions of n into distinct parts where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261836

Irregular triangle T(n,k), n>=1, 1<=k<=ceiling(n/2), read by rows: T(n,k) is the number of different ways to select k disjoint (nonempty) subsets from {1..n} with equal element sum. A196231

Number of distinct prime signatures of the positive integers up to 2ⁿ. A25488

Number of multisets summing to n that do not contain 1 and are not the first sums of any multiset. A390431

Fifth binomial transform of Fibonacci numbers F(n). A81575

Numbers k such that k! is divisible by the square of (f+d)!² for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2). A56068

Smallest m such that A132575(m) = n. A132576