4460
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
- 12
- Divisor Sum
- 9408
- Proper Divisor Sum (Aliquot Sum)
- 4948
- 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
- 1776
- Möbius Function
- 0
- Radical
- 2230
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 95
- 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 n-celled free polyominoes without holes.at n=10A000104
- a(n) = ceiling(1000*log_2(n)).at n=21A004267
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=18A007589
- Coordination sequence T2 for Zeolite Code -CHI.at n=42A009847
- Expansion of 1/((1-x)(1-4x)(1-5x)(1-12x)).at n=3A021794
- [ (4th elementary symmetric function of S(n))/(2nd elementary symmetric function of S(n)) ], where S(n) = {first n+3 positive integers congruent to 2 mod 3}.at n=10A024402
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 1,1,1,2.at n=10A025272
- Values of A038007 not ending in 6 or 8.at n=4A038009
- McKay-Thompson series of class 8C for Monster.at n=6A052241
- a(n) = T(n,n-5), array T as in A055801.at n=27A055805
- Triangle read by rows: number of asymmetric monoids of order n with k idempotents.at n=24A058140
- Numbers k such that phi(k) divides (sigma(k+2) + sigma(k-2)).at n=34A067245
- One eighth of fourth column of triangle A067298.at n=3A067301
- Interprimes which are of the form s*prime, s=20.at n=6A075295
- Sums of terms of groups in A075626.at n=19A075629
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; then a(n) is the number of partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p <= A000230(n).at n=38A079023
- Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k = 1.at n=14A093371
- Row sums of triangle A109152.at n=7A109156
- Triangle read by rows: number of Dyck paths of semilength n having k 3-bridges of a given shape (0<=k<=floor(n/3)). A 3-bridge is a subpath of the form UUUDDD or UUDUDD starting at level 0.at n=18A114499
- Number of Dyck paths of semilength n having no UUUDDD's starting at level zero; here U=(1,1), D=(1,-1). Also number of Dyck paths of semilength n having no UUDUDD's starting at level zero.at n=9A114500