4864
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 10220
- Proper Divisor Sum (Aliquot Sum)
- 5356
- 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
- 2304
- Möbius Function
- 0
- Radical
- 38
- Omega Function (Ω)
- 9
- 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
- 28
- 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 symmetric filaments (strip polyominoes) with n square cells.at n=22A002014
- a(n) = floor( n*(n-1)*(n-2)/20 ).at n=47A011902
- a(n) = (2*n - 13)*n^2.at n=16A015246
- Coordination sequence T2 for Zeolite Code CZP.at n=45A019457
- a(n) = n*(27*n - 1)/2.at n=19A022284
- Sum{T(n,k)*T(n,k+3)}, 0<=k<=2n-3, T given by A027926.at n=4A027997
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 33.at n=26A031531
- Sorted elements of table (A035002) of a(m,n) = sum(a(m-k,n), k=1..m-1)+sum(a(m,n-k), k=1..n-1).at n=34A035001
- Square array read by antidiagonals: T(m,n) = Sum_{k=1..m-1} T(m-k,n) + Sum_{k=1..n-1} T(m,n-k).at n=58A035002
- a(n) = prime(n) * Product_{k=0..n-2} prime(n-k) mod prime(n-k-1).at n=7A037169
- Denominators of continued fraction convergents to sqrt(544).at n=4A042041
- Numerators of continued fraction convergents to sqrt(869).at n=4A042678
- Numbers that are divisible by at least 9 primes (counted with multiplicity).at n=31A046311
- Numbers that are divisible by exactly 9 primes with multiplicity.at n=20A046312
- n is divisible by the 4th power of the number of unitary divisors of n (A034444).at n=22A048170
- Numbers n such that A048767(n) = n.at n=23A048768
- Number of horizontally convex n-ominoes in which the top row has exactly 1 square, which is not above the rightmost square in the second row.at n=9A049221
- Number of ordered factorizations with 2 levels of parentheses indexed by prime signatures.at n=15A050357
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=11A054236
- Numbers k such that sigma(x) = k has exactly 5 solutions.at n=40A060661