10077
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 3363
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6716
- Möbius Function
- 1
- Radical
- 10077
- Omega Function (Ω)
- 2
- 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
- 86
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 66.at n=37A031564
- Number of composite numbers whose juxtaposition of prime factors has length n.at n=4A036334
- Denominators of continued fraction convergents to sqrt(429).at n=8A041817
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=36A104809
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 2X4 el 1,1 1,2 1,3 1,4 2,4 with any orientation.at n=9A146016
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=20A181881
- Number of (n+1)X2 0..4 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=2A203863
- Number of (n+1) X 4 0..4 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=0A203865
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=3A203870
- T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=5A203870
- Polylogarithm li(-n,-3/8) multiplied by (11^(n+1))/8.at n=5A213140
- Number of length n+2 0..3 arrays with no consecutive three elements summing to more than 3.at n=7A241609
- T(n,k)=Number of length n+2 0..k arrays with no consecutive three elements summing to more than k.at n=52A241619
- Start with a single square; at n-th generation add a square at each expandable vertex (this is the "vertex to side" version); a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=17A247903
- Number of nX7 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=2A275130
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=38A275131
- Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=6A275132
- Integers m such that sigma(m) + sigma(m+1) + sigma(m+2) - sigma(m+3) <= 0, where sigma is the sum of divisors.at n=0A348698
- Number of 1243-avoiding even Grassmannian permutations of size n.at n=49A361272
- Number of 1342-avoiding even Grassmannian permutations of size n.at n=49A361274