8113
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9920
- Proper Divisor Sum (Aliquot Sum)
- 1807
- 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
- 6480
- Möbius Function
- -1
- Radical
- 8113
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 114
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(phi*a(n-1)) + a(n-2) where phi is the golden ratio.at n=12A005830
- Pseudoprimes to base 11.at n=24A020139
- Pseudoprimes to base 50.at n=41A020178
- Pseudoprimes to base 75.at n=38A020203
- Strong pseudoprimes to base 75.at n=18A020301
- Describe the previous term! (method B - initial term is 8).at n=3A022504
- Expansion of 1/((1-4x)(1-6x)(1-9x)(1-10x)).at n=3A028139
- Number of 5-ary rooted trees with n nodes and height exactly 6.at n=14A036637
- Number of partitions satisfying cn(0,5) <= cn(1,5) + cn(2,5) and cn(0,5) <= cn(4,5) + cn(2,5) and cn(0,5) <= cn(1,5) + cn(3,5) and cn(0,5) <= cn(4,5) + cn(3,5).at n=33A039843
- a(1) = 5; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=47A046255
- a(n)=T(n,n), array T as in A049735.at n=36A049740
- Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.at n=13A070880
- Nonprimes k such that k divides 3^(k-1) - 2^(k-1).at n=22A073631
- a(n) = 4^n + 6^n + 9^n.at n=4A074567
- Binomial transform of 1, 1, 1, 2, 2, 2, 2, 2, ...at n=12A084634
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=28A090495
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=13A098936
- Expansion of c(8*x^2)/(1 - x*c(8*x^2)), where c(x) is the g.f. of A000108.at n=7A132375
- Products of three distinct primes of the form 6*k + 1.at n=13A154729
- Products of 3 distinct non-Sophie Germain primes.at n=29A157347