4475
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5580
- Proper Divisor Sum (Aliquot Sum)
- 1105
- 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
- 3560
- Möbius Function
- 0
- Radical
- 895
- Omega Function (Ω)
- 3
- 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
- 139
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=20A026043
- a(n) = Sum_{k=0..n} (k+1) * A026714(n, k).at n=8A027205
- a(n) = floor(n^3 / e).at n=23A032636
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 4 (mod 5).at n=47A035576
- Sum of first n primes of form 4k-1.at n=32A038347
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=31A043077
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=44A050024
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=44A050040
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 1.at n=44A050056
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=26A051897
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=24A051939
- Row sums of triangle A059037.at n=5A059040
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4.at n=6A061222
- First of 3 consecutive numbers which are cubefree and not squarefree, i.e., numbers k such that {k, k+1, k+2} are in A067259.at n=23A071319
- Numbers n such that n and n+2 are of the form p^2*q where p and q are distinct primes.at n=19A074173
- Absolute value of difference between counts of uninterrupted runs of 2 primes in A092639 and A092640.at n=8A092641
- a(1)=1; a(n+1) = Sum_{k=1 to n} a(k) a(ceiling(n/k)).at n=10A097919
- Positive integers i for which A112049(i) == 6.at n=28A112066
- Numbers k such that the k-th triangular number contains only digits {0,1,5}.at n=14A119040
- Floor of the area of consecutive Prime-Indexed Prime triangles.at n=5A119659