4481
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4482
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 4480
- Möbius Function
- -1
- Radical
- 4481
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 46
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 608
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=23A001583
- Half-quartan primes: primes of the form p = (x^4 + y^4)/2.at n=5A002646
- Numbers that are the sum of 8 positive 6th powers.at n=47A003364
- From relations between Siegel theta series.at n=54A006476
- Prime(n)*...*a(n) is the least product of consecutive primes which is non-deficient.at n=17A007686
- Prime(n)*...*a(n) is the least product of consecutive primes which is abundant.at n=17A007708
- Primes p == 1 (mod 8), p = a^2 +64*b^2 such that y^2 = x^3 + p*x has rank 0.at n=20A007765
- a(n) = floor( n*(n-1)*(n-2)/19 ).at n=45A011901
- Numbers k such that the continued fraction for sqrt(k) has period 27.at n=16A020366
- Primes that remain prime through 2 iterations of function f(x) = 3x + 8.at n=40A023248
- Number of positive integers that are not the sum of distinct n-th-order polygonal numbers.at n=34A025524
- Primes of the form k^2 - 8.at n=17A028886
- Palindromic primes in base 8.at n=18A029976
- a(0) = 3; for n > 0, a(n) is the greatest prime factor of a(n-1)^2 - 2.at n=4A031440
- Upper prime of a difference of 18 between consecutive primes.at n=14A031937
- Primes of form x^2+65*y^2.at n=32A033241
- Primes of form x^2+77*y^2.at n=31A033249
- Primes that do not contain any other prime as a proper substring.at n=33A033274
- Denominators of continued fraction convergents to sqrt(155).at n=6A041285
- Denominators of continued fraction convergents to sqrt(620).at n=6A042191