10704
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 27776
- Proper Divisor Sum (Aliquot Sum)
- 17072
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3552
- Möbius Function
- 0
- Radical
- 1338
- Omega Function (Ω)
- 6
- 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
- yes
- 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 primitive (aperiodic) step shifted (decimated) sequences using exactly four different symbols.at n=7A056388
- Triangle T(n,k) read by rows giving number of fixed 4 X k polyominoes with n cells (n >= 4, 1<=k<=n-3).at n=43A059680
- a(n) = |{m : multiplicative order of 9 mod m = n}|.at n=35A059891
- Number of squares (of another matrix) in M_2(n) - the ring of 2 X 2 matrices over Z_n.at n=19A068197
- a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000).at n=37A096973
- The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts.at n=35A102186
- Numbers n such that 6*10^n + 7*R_n + 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=10A103043
- a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime.at n=25A152530
- Numbers that have 9 terms in their Zeckendorf representation.at n=30A179249
- Number of n X 2 0..2 arrays with rows and columns in nondecreasing order.at n=7A184130
- Number of n X 8 0..2 arrays with rows and columns in nondecreasing order.at n=1A184136
- T(n,k)=Number of nXk 0..2 arrays with rows and columns in nondecreasing order.at n=37A184137
- 1/4 the number of (n+1) X 2 binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3.at n=7A184596
- 1/4 the number of (n+1) X 9 binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3.at n=0A184603
- T(n,k) = 1/4 the number of (n+1) X (k+1) binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3.at n=28A184604
- T(n,k) = 1/4 the number of (n+1) X (k+1) binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3.at n=35A184604
- Number of nX4 arrays of occupancy after each element stays put or moves to some king-move neighbor, with every occupancy equal to zero or two.at n=3A221336
- T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some king-move neighbor, with every occupancy equal to zero or two.at n=24A221337
- G.f.: exp( Sum_{n>=1} x^n * (1+x)^n / (n*(1-x^n)) ).at n=16A227681
- Number of (n+1)X(n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=1A250537