8692
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 15876
- Proper Divisor Sum (Aliquot Sum)
- 7184
- 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
- 4160
- Möbius Function
- 0
- Radical
- 4346
- Omega Function (Ω)
- 4
- 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
- 140
- 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
- Bessel function J_0(n) is a monotonically decreasing positive sequence.at n=21A046960
- Bessel function |J_0(n)| is a monotonically decreasing positive sequence.at n=39A046962
- a(n) is the index of the smallest triangular number containing exactly n 7's.at n=4A048362
- floor[2^n/Fibonacci(n)].at n=38A057861
- Number of series-parallel networks with n unlabeled edges, multiple edges not allowed.at n=13A058387
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=39A080392
- Cumulative sum of absolute values of coefficients of q^(2n) in the series expansion of Ramanujan's mock theta function f(q).at n=30A109471
- Numbers n such that the sum of the digits of sigma(n)^phi(n) is divisible by n.at n=11A109669
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A149347
- Number of ways to place zero or more nonadjacent 1,0 1,1 2,1 3,1 4,2 5,2 6,2 6,3 polyhexes in any orientation on a planar nXnXn triangular grid.at n=7A155400
- Averages of four consecutive cubes.at n=20A173965
- Sum of positive cranks minus the sum of positive ranks of all partitions of n.at n=38A195012
- Positive integers b in primitive (1/4)-Pythagorean triples (a,b,c) satisfying a<=b, in order of increasing a and then increasing b.at n=46A196263
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.at n=15A200193
- Number of n X 5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=5A207400
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=50A207403
- Number of 6Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=4A207406
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209583; see the Formula section.at n=49A209584
- Least k such that k*30^n-1 , k*30^n+1, and 2*k*30^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=30A212956
- Number of n X 3 0..1 arrays with rows and columns unimodal and antidiagonals nondecreasing.at n=10A223772