7010
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12636
- Proper Divisor Sum (Aliquot Sum)
- 5626
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2800
- Möbius Function
- -1
- Radical
- 7010
- Omega Function (Ω)
- 3
- 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
- 57
- 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
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=47A017853
- Numbers k such that the continued fraction for sqrt(k) has period 17.at n=39A020356
- a(n) = Sum_{k=0..floor((n-3)/2)} T(n,k) * T(n,k+2), with T given by A008315.at n=6A027303
- a(1) = 1; a(n+1) is the smallest number > a(n) which differs from it at every digit.at n=33A068860
- a(n+1) = least positive integer not already used that begins with the last two digits of a(n).at n=34A098753
- Write 0, 1, ..., n in base 3 and add as if they were decimal numbers.at n=30A121718
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=19A136865
- a(n) = 250*n + 10.at n=27A154379
- Number of 8 X 8 arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to n.at n=4A156396
- Number of n X n arrays of squares of integers, symmetric about both diagonal and antidiagonal, with all rows summing to 4.at n=7A156435
- Number of Hamiltonian cycles in C_6 X P_n.at n=4A180582
- G.f. satisfies: A(x) = (1+x*A(x))*(1+x^2*A(x))*(1+x^3*A(x)).at n=11A182053
- Number of partitions of n containing a clique of size 4.at n=35A183561
- Number of (n+1) X 2 0..2 arrays with every 2 X 3 or 3 X 2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=3A206754
- Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=0A206757
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=6A206761
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..2 introduced in row major order.at n=9A206761
- Numbers which are the sum of two squared primes in exactly two ways (ignoring order).at n=37A226539
- Triangle read by rows related to double factorial of odd numbers (A001147).at n=23A230696
- Combined weight, as defined at A244094, of the distinct-parts partitions of n.at n=22A234924