8410
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15678
- Proper Divisor Sum (Aliquot Sum)
- 7268
- 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
- 3248
- Möbius Function
- 0
- Radical
- 290
- Omega Function (Ω)
- 4
- 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
- 96
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of triples (i,j,k) with 1 <= i < j < k <= n and gcd(i,j,k) = 1.at n=39A015616
- Number of triples of different integers from [ 2,n ] with no global factor.at n=39A015618
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=35A020362
- T(n,1) + T(n,2) + ... + T(n,n), T given by A026703.at n=11A026710
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=4A031947
- Numbers k such that 237*2^k+1 is prime.at n=13A032495
- Numbers whose set of base-7 digits is {3,4}.at n=32A032831
- a(n) = 10*n^2.at n=29A033583
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 2 (mod 5).at n=59A035582
- Numbers whose base-7 representation contains exactly four 3's.at n=18A043408
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=4A049357
- Numbers n such that 257*2^n-1 is prime.at n=25A050887
- Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).at n=29A051943
- Number of divisors of n equals the average of distinct prime factors of n.at n=33A067547
- Minimal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d=6*p (p=any odd prime).at n=11A093194
- Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=9A096554
- Bisection of A001157: sigma_2(2n).at n=40A099979
- Numbers k such that 4*10^k+3 is prime.at n=15A101397
- Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime.at n=23A111064
- Consider the array T(n, m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the row sum of A to the first coefficient of one.at n=23A112285