4073
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
- 2
- Divisor Sum
- 4074
- 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
- 4072
- Möbius Function
- -1
- Radical
- 4073
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 95
- 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
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 561
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Crystal ball sequence for planar net 3.6.3.6.at n=42A008580
- Coordination sequence T1 for Zeolite Code RUT.at n=42A009897
- a(n) = prime(n*(n+1)/2).at n=32A011756
- sech(arcsin(arcsinh(x)))=1-1/2!*x^2+5/4!*x^4-109/6!*x^6+4073/8!*x^8...at n=4A012122
- Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19).at n=41A014561
- Numbers k such that the continued fraction for sqrt(k) has period 35.at n=9A020374
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=15A023282
- Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=2A023312
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=21A024972
- Upper prime of a difference of 16 between consecutive primes.at n=12A031935
- Numbers having three 5's in base 9.at n=12A043475
- Primes with first digit 4.at n=30A045710
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.at n=35A053522
- a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1.5, p=2.at n=22A053522
- a(n) = (Sum of the first n primes) + n.at n=44A060939
- Primes of form Sum_{k=1..n} (prime(k)+1).at n=20A062736
- Primes with two representations: p*q*r - 2 = u*v*w + 2 where p, q, r, u, v and w are primes (not necessarily distinct).at n=28A063645
- Zero, together with positive numbers k such that prime(k) - k is a square.at n=22A064370
- Primes p such that p^6 + p^3 + 1 is prime.at n=23A066100
- Factorable subsets: the number of proper subsets S of {1,2,...,n} that can be expressed in the form S=A*B, where S is defined to be the set {a(i)*b(j)| a(i) in A, b(j) in B}.at n=21A068594