9700
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 21266
- Proper Divisor Sum (Aliquot Sum)
- 11566
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 970
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 166
- 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) = n*(31*n + 1)/2.at n=25A022289
- Number of inequivalent strings of 2n digits, when 2 strings are equivalent if turning 1 upside down gives the other.at n=2A036257
- Number of inequivalent strings of n digits, when 2 strings are equivalent if turning 1 upside down gives the other.at n=4A036258
- a(n) = prime(n)*prime(n+1) - prime(n).at n=24A037166
- Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=13A054208
- Number of series-reduced (or homeomorphically irreducible) graphs with loops on n labeled nodes.at n=5A060516
- Number of fault-free tilings of a 4 X 2n rectangle with L tetrominoes.at n=11A084481
- a(n) = (3*n+1)*(3*n+4).at n=32A085001
- Sum of first n 7-almost primes.at n=15A086059
- Number of permutations of length n which avoid the patterns 2314, 4213, 4312.at n=8A116806
- Indices n such that A134204(n) < n.at n=14A133242
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=21A136865
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 7 and 9.at n=21A136907
- Numbers k such that k and k^2 use only the digits 0, 3, 4, 7 and 9.at n=12A136934
- Numbers k such that k and k^2 use only the digits 0, 4, 5, 7 and 9.at n=8A136952
- Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 9.at n=13A136955
- Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=20A136959
- Numbers k such that k and k^2 use only the digits 0, 4, 7 and 9.at n=8A136960
- a(n) = 97*n^2.at n=10A174338
- a(n) = 1, 7, A011557*(period 6: repeat 10, 13, 31, 49, 70, 97).at n=19A178508