3803
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
- 3804
- 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
- 3802
- Möbius Function
- -1
- Radical
- 3803
- 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
- 82
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 529
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=46A000355
- Solid partitions of n, distinct along rows.at n=11A002936
- Reflectable emirps.at n=15A007628
- Primes of form 3*k^2 - 3*k + 23.at n=31A007637
- Primes of form 2n^2 - 2n + 19.at n=34A007639
- a(n) = prime(n^2).at n=22A011757
- a(n) = ceiling((n+1/n)^n).at n=4A014058
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 4.at n=15A022318
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.at n=32A024467
- Number of proper factorizations of p1^n*p2^5, where p1 and p2 are distinct primes.at n=10A031128
- 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 61.at n=6A031559
- Lower prime of a difference of 18 between consecutive primes.at n=9A031936
- Primes of form x^2+71*y^2.at n=34A033246
- Coordination sequence T6 for Zeolite Code ESV.at n=41A038413
- Coordination sequence T8 for Zeolite Code STT.at n=41A038418
- Denominators of continued fraction convergents to sqrt(415).at n=10A041789
- Numbers having three 3's in base 8.at n=27A043435
- Numbers k such that the string 0,3 occurs in the base 10 representation of k but not of k-1.at n=40A044335
- Discriminants of imaginary quadratic fields with class number 15 (negated).at n=15A046012
- Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2*n.at n=34A052358