10906
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
- 16
- Divisor Sum
- 20160
- Proper Divisor Sum (Aliquot Sum)
- 9254
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 1
- Radical
- 10906
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 68
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = n*(13*n - 1)/2.at n=41A022270
- Structured heptagonal diamond numbers (vertex structure 5).at n=18A100179
- a(n) = p(n)*p(n+2) - 3*p(n+1), where p(n) is the n-th prime.at n=26A152528
- a(n) = 343*n - 70.at n=31A157374
- Number of n X n 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(n+1) binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=4A227264
- Number of nX5 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X6 binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=4A227268
- T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=40A227269
- Squarefree numbers that are k*A005117(k) for some k.at n=39A257832
- Numbers k such that R_k + 7*10^k + 6 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=1A259138
- Number of (n+1)X(5+1) 0..1 arrays with each row nonprime and column prime, read as a binary number with top and left being the most significant bits.at n=2A261940
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row nonprime and column prime, read as a binary number with top and left being the most significant bits.at n=23A261942
- Number of (3+1)X(n+1) 0..1 arrays with each row nonprime and column prime, read as a binary number with top and left being the most significant bits.at n=4A261945
- a(1) = 0, a(2) = 1; and for n > 2, a(n) = 2*a(A285712(n)) + [1 == (n mod 3)].at n=23A292591
- a(1) = 0, a(2) = 1; and for n > 2, a(n) = 2*a(A285712(n)) + [1 == (n mod 3)].at n=64A292591
- Total area of all squares with squarefree side length |s - t|, such that n = s + t, and s < t, where s and t are positive integers.at n=42A303052
- Number of distinct edges among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.at n=13A359047
- G.f.: Sum_{k>=0} x^(k*(k+1)) / Product_{j=1..k} (1 - x^(2*j-1))^2.at n=46A376622
- Numbers k such that A003415(k) == A276085(k) (mod 5^5), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function.at n=9A391865