4487
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5136
- Proper Divisor Sum (Aliquot Sum)
- 649
- 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
- 3840
- Möbius Function
- 1
- Radical
- 4487
- 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
- 46
- 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
- Numbers k such that Fib(k) == 13 (mod k).at n=27A023178
- 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 65.at n=23A031563
- Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=30A035988
- Numbers whose base-4 representation has exactly 7 runs.at n=29A043598
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=29A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=29A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=29A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=29A043874
- a(n) = prime(n)^2 - 2.at n=18A049001
- Matrix 7th power of partition triangle A008284.at n=48A050301
- Numbers k such that floor(exp(k)) is prime.at n=9A050808
- Weight 5 level 11 cusp form with complex multiplication by Q(sqrt(11)) and trivial character.at n=58A065099
- Numbers k such that k and 3^k end with the same two digits.at n=44A067749
- a(n) = 4*n^2 + 4*n - 1.at n=32A073577
- Indices of spheres mentioned in A071609.at n=40A076180
- Greatest squarefree number not exceeding n-th prime power which is not prime.at n=41A081218
- a(n) = (1/6)*(n+1)*(10*n^2 + 17*n + 12).at n=13A102296
- Sum of the vertices of ordered 3 prime sided prime triangles.at n=39A105101
- Row sums of triangle A105537, which equals the matrix square of triangle A105535.at n=10A105538
- Matrix cube of triangle A105535 and, in this flattened form as read by rows, also equals diagonal 2 of A105535.at n=55A105539