4550
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 10416
- Proper Divisor Sum (Aliquot Sum)
- 5866
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1440
- Möbius Function
- 0
- Radical
- 910
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 20
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of sublattices of index n in generic 3-dimensional lattice.at n=35A001001
- 4-dimensional pyramidal numbers: a(n) = (3*n+1)*binomial(n+2, 3)/4. Also Stirling2(n+2, n).at n=13A001296
- Least k such that H(k) > n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=9A002387
- Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 with 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum a(P(n)), n>0.at n=53A004065
- Least k such that H(k) >= n, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=9A004080
- Number of partitions of n into 3 or more parts.at n=28A004250
- Numbers k such that if 2 <= j < k then the fractional part of the k-th partial sum of the harmonic series is < the fractional part of the j-th partial sum of the harmonic series.at n=5A004796
- Coordination sequence T3 for Zeolite Code CAS.at n=41A008065
- Coordination sequence T4 for Zeolite Code NES.at n=43A008208
- Stirling numbers of second kind S2(15,n).at n=12A011564
- Triangle read by rows, the inverse Bell transform of n!*binomial(5,n) (without column 0).at n=25A013988
- Powers of cube root of 3 rounded up.at n=23A017984
- Coordination sequence T2 for Zeolite Code MWW.at n=45A024987
- Number of n-move king paths on 8 X 8 board from given corner to any square.at n=5A025595
- a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2*n-1) = 5. Also a(n) = T(2*n-1,n-2), where T is the array defined in A026009.at n=6A026017
- If d,e are consecutive digits of n in base 7, then |d-e|>=5.at n=31A032995
- Denominators of continued fraction convergents to sqrt(212).at n=13A041395
- Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.at n=18A049031
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=15A049919
- T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=31A050161