10336
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 12344
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 646
- Omega Function (Ω)
- 7
- 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
- 104
- 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
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/9).at n=19A011919
- a(n) = n*(9*n-2).at n=34A013656
- Fibonacci sequence beginning 0, 4.at n=18A022087
- Expansion of Product_{m>=1} (1+m*q^m)^-17.at n=6A022709
- Increasing gaps among twin primes: size.at n=45A036063
- Main diagonal of array in A038150.at n=7A047923
- Molien series for group G_{1,2}^{8} of order 1536.at n=28A051462
- Numbers k such that A072010(k) = k.at n=39A072011
- Nonsquares with A072594(n) = 0.at n=23A072596
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=34A075604
- a(n) = Fibonacci(n)*Fibonacci(3n)/2.at n=6A085695
- Expansion of (1-2*x-3*x^2)/((1-2*x)*(1-4*x)).at n=7A087440
- a(n) = 4 + floor((3 + Sum_{j=1..n-1} a(j))/4).at n=35A120163
- Ramanujan numbers (A000594) read mod 16384.at n=5A126824
- Row sums of triangle A131327.at n=17A131328
- Records in A139251.at n=41A152768
- Number of nX2 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=16A166814
- Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j.at n=47A169691
- The smallest number which when multiplied by the n-th repunit gives a Smith number.at n=29A176385
- Number of closed walks of length 16 and algebraic area n in the square lattice.at n=11A178106