10700
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 23436
- Proper Divisor Sum (Aliquot Sum)
- 12736
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4240
- Möbius Function
- 0
- Radical
- 1070
- Omega Function (Ω)
- 5
- 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
- 47
- 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) = (9*n+1)*(9*n+8).at n=11A001534
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=40A004006
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=47A024854
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=16A033829
- Number of primitive (aperiodic) step shifted (decimated) sequence structures using exactly five different symbols.at n=9A056409
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=30A136865
- Number of (n+1)X(1+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=2A238065
- Number of (n+1)X(3+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A238067
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=3A238072
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=5A238072
- Total number of occurrences of the pattern 1<2<3 in all preferential arrangements (or ordered partitions) of n elements.at n=5A240800
- Number of length-n 0..3 arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo 3+1.at n=6A269673
- T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo k+1.at n=42A269678
- Number of length-7 0..n arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo n+1.at n=2A269682
- a(n) = Sum_{k=0..7} (n + k)^2.at n=33A276026
- Numbers in which 0 outnumbers all other digits together.at n=44A292730
- G.f.: Sum_{k>=1} x^(2*k-1)/(1+x^(2*k-1)) * Product_{k>=1} (1+x^k)/(1-x^k).at n=21A305124
- Integers n such that the digit set of n^2 is {0,1,4,9}.at n=25A317579
- Number of series-reduced rooted identity trees whose leaves are strict integer partitions whose multiset union is an integer partition of n.at n=11A320177
- Numbers k such that the k-th and (k+1)-st primes have the same digits.at n=41A342874