10708
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 18746
- Proper Divisor Sum (Aliquot Sum)
- 8038
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5352
- Möbius Function
- 0
- Radical
- 5354
- Omega Function (Ω)
- 3
- 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
- Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 0.at n=5A001396
- Increasing gaps among twin primes: size.at n=47A036063
- Number of monocyclic skeletons with n carbon atoms and a ring size of 7.at n=9A120790
- a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10.at n=17A154496
- Total number of possible standard knight moves on an n X 2n chessboard, if the knight is placed anywhere.at n=26A180319
- Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=5A196632
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=3A196634
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=39A196636
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,2,0,4 for x=0,1,2,3,4.at n=41A196636
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4.at n=3A196639
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4.at n=39A196641
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,4,2,0,3 for x=0,1,2,3,4.at n=41A196641
- Numbers k such that 4^k + 25 is prime.at n=29A204388
- Least number having n orderless representations as p^2 + q^2 + r^2 + s^2, where p, q, r, and s are primes.at n=39A214513
- Triangle read by rows: Number of 2n-step self-avoiding walks on diamond lattice ending at point with x = 2k.at n=15A227715
- Number of binary strings of length n avoiding the pattern x x x^R (where x^R means reverse of x).at n=52A241903
- Number of terms of A182116 between 2^n and 2^(n+1).at n=56A242435
- Number of lattice paths from (0,0) to (n,n) which do not go above the diagonal x=y using steps (1,k), (k,1) with k>=2.at n=14A263316
- Number of n X n integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself.at n=6A266006
- Number of n X 7 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself.at n=6A266011