4955
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 997
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3960
- Möbius Function
- 1
- Radical
- 4955
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 72
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers that are the sum of 6 positive 6th powers.at n=36A003362
- a(n) = ceiling(1000*log_2(n)).at n=30A004267
- Number of paraffins.at n=27A005999
- Coordination sequence T3 for Zeolite Code DDR.at n=44A008073
- Coordination sequence T1 for Zeolite Code NES.at n=45A008205
- Number of distinct prime signatures of the positive integers up to 2^n.at n=41A025488
- Numbers k such that k! is divisible by the square of (f+d)!^2 for d = 0, 1 and 2 (and possibly larger d), where f = floor(k/2).at n=21A056068
- a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=43A058082
- Fifth binomial transform of Fibonacci numbers F(n).at n=5A081575
- Square array of binomial transforms of Fibonacci numbers, read by antidiagonals.at n=60A081576
- a(n) = 5*(n^2 - n + 2)/2.at n=45A082450
- Least positive integer that can be represented as sum of a semiprime and a square in exactly n ways.at n=41A101181
- n(k) is the minimum number that require at least k to make Prime[n]+2*Prime[n+k] a prime.at n=48A114264
- a(n) = 9 + floor( Sum_{j=1..n-1} a(j)/3 ).at n=22A120154
- Number of integer-sided hexagons having perimeter n.at n=26A124286
- Smallest m such that A132575(m) = n.at n=37A132576
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 9.at n=25A136901
- Number of different equations that can be made by summing numbers from 1 to n and using every number not more than once.at n=11A161943
- 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.at n=37A196231
- Number of 4-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=14A209116