4461
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 1491
- 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
- 2972
- Möbius Function
- 1
- Radical
- 4461
- 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
- 95
- 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
- a(n) = smallest number k such that Product_{i=1..k} prime(i)/(prime(i)-1) > n.at n=19A005579
- Number of asymmetric polyominoes with n cells.at n=9A006749
- Number of 4-regular polyhedra with n nodes.at n=17A007022
- Coordination sequence T2 for Zeolite Code AFO.at n=44A008016
- Triangle of numbers arising from analysis of Levine's sequence A011784.at n=54A014621
- Numbers k such that the continued fraction for sqrt(k) has period 64.at n=14A020403
- Convolution of Lucas numbers and A023533.at n=16A023623
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 2. Also a(n) = T(n,n-2), where T is the array defined in A025177.at n=8A025180
- 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 44.at n=22A031542
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+5 or 24k-5. Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=43A036031
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=65A036865
- Numbers having three 5's in base 8.at n=28A043443
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A046255
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 61 ).at n=29A063334
- Cardinality of set of sets of parts of all partitions of n.at n=37A088314
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=29A115160
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (-1, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A149646
- a(n) = 2*n^2 + 22*n + 9.at n=41A154600
- Number of circular permutations of length n without 3-sequences.at n=5A165961
- a(n) = smallest m > 0 such that there are no primes between p*m and p*(m+1) inclusive where p is the n-th prime.at n=22A174741