4093
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4094
- 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
- 4092
- Möbius Function
- -1
- Radical
- 4093
- 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
- 64
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 564
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Irregular table read by rows: row n lists prime factors of 10^n + 1, with multiplicity.at n=27A001271
- a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.at n=3A004970
- From relations between Siegel theta series.at n=49A006476
- Primorial -1 primes: primes p such that -1 + product of primes up to p is prime.at n=12A006794
- Largest prime <= 2^n.at n=11A014234
- Numbers k such that the continued fraction for sqrt(k) has period 19.at n=28A020358
- Primes that remain prime through 3 iterations of function f(x) = 3x + 10.at n=27A023280
- Divisors of 10^11 + 1.at n=6A027899
- Primes of form k^2 - 3.at n=12A028874
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=10A029580
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 4.at n=32A031417
- a(n) = 2^n - 3.at n=12A036563
- Sums of 11 distinct powers of 2.at n=10A038462
- Numbers having three 7's in base 8.at n=26A043451
- Numbers whose base-5 representation contains exactly two 1's and three 3's.at n=15A045243
- Primes with first digit 4.at n=33A045710
- Triangle of prime numbers in which n-th row lists all primes p such that 1/p has decimal period n, n >= 1.at n=36A046107
- Upper members of a "good pair" of the form (k, 2*k +- 1).at n=29A046862
- Array T read by diagonals, n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+n)^2, for n=1,2,3,...; k=0,1,2,...at n=47A048505
- a(n) = T(2,n), array T given by A048505.at n=7A048507