8363
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8364
- 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
- 8362
- Möbius Function
- -1
- Radical
- 8363
- 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
- 65
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1047
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of positive integers <= 2^n of form x^2 + y^2.at n=15A000050
- a(n) = a(n-1) + a(n-2) - 1.at n=19A001588
- Number of primes with n digits.at n=5A006879
- a(n) = floor((Pi/2)^n).at n=20A014214
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=25A023296
- Primes that remain prime through 4 iterations of function f(x) = 9x + 2.at n=11A023324
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=40A024837
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=39A024842
- 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 91.at n=6A031589
- Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).at n=10A036880
- Numbers whose base-4 representation contains exactly two 0's and four 2's.at n=29A045051
- Number of partitions of n with equal number of parts congruent to each of 1, 2, 3 and 4 (mod 5).at n=60A046775
- a(n) = T(n,n-3), array T as in A055818.at n=33A055820
- McKay-Thompson series of class 33B for Monster.at n=36A058637
- Primes p such that x^37 = 2 has no solution mod p.at n=28A059223
- Primes which, although they have correct parity, are not in the prime number maze.at n=5A065123
- a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.at n=35A073609
- Prime numbers using only the curved digits 0, 3, 6, 8 and 9.at n=34A079652
- a(n) = 6*n^2 + 4*n + 1.at n=37A080859
- Members of A083989 whose 10's complement is also a member of A083989.at n=17A083991