10688
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 21336
- Proper Divisor Sum (Aliquot Sum)
- 10648
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5312
- Möbius Function
- 0
- Radical
- 334
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 2
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
- 73
- 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
- Spiral sieve using Fibonacci numbers.at n=19A005624
- Expansion of sinh(tan(x)^2)/2.at n=4A024287
- Expansion of (theta_3(z)*theta_3(2z)+theta_2(z)*theta_2(2z))^4.at n=35A028579
- Numbers k such that 261*2^k+1 is prime.at n=51A032507
- Nonprime numbers k such that sum of aliquot divisors of k is a cube.at n=33A048698
- Number of 3-multigraphs on n nodes.at n=4A053400
- Pure 2-complexes on n nodes with at most 3 multiple 2-simplexes.at n=4A053426
- When squared gives number composed just of the digits 1, 2, 3, 4.at n=24A061677
- Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals.at n=32A063841
- Number of n-multigraphs on 5 nodes.at n=4A063843
- Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=11A099771
- Number of positive integers <= 10^n that are divisible by no prime exceeding 7.at n=11A106600
- Triangle T(n,k) of number of labeled directed multigraphs (with loops), without isolated vertices, with n arrows and k vertices (n = 1,2,.., k = 1..2*n).at n=23A120945
- First terms "a" of quadruples a>b>c>d>0 with six square pairwise sums.at n=27A175534
- Number of line segments connecting exactly 9 points in an n x n grid of points.at n=37A177725
- Number of 7-step S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=7A187381
- Composite numbers k such that k = (product of divisors of k) mod (sum of divisors of k).at n=36A187712
- Numbers with prime factorization p*q^6.at n=42A189987
- Number of partitions p of n such that (number of even numbers in p) < (number of odd numbers in p).at n=37A241636
- Nonprimes n such that the sum of proper divisors of n and the product of proper divisors of n are both perfect cubes.at n=6A244429