7886
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 6
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11832
- Proper Divisor Sum (Aliquot Sum)
- 3946
- 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
- 3942
- Möbius Function
- 1
- Radical
- 7886
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 176
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Powers of fifth root of 14 rounded to nearest integer.at n=17A018154
- Powers of fifth root of 14 rounded up.at n=17A018155
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=17A020415
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 88.at n=10A031586
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 36 ones.at n=41A031804
- Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=33A035988
- Expansion of (1/(1-x^2))*Product_{m>=0} 1/(1-x^(2m+1)).at n=44A038348
- Numbers with multiplicative persistence value 6.at n=5A046515
- k such that k-th prime is of the form 2n^2 + 3n + 3.at n=29A096690
- Triangle: number of exactly (m-1)-dimensional partitions of n, for n >= 1, m >= 0.at n=61A119271
- 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, 1, 0), (1, 0, -1), (1, 0, 0)}.at n=11A148022
- a(n) = (11*n^2 + 19*n + 10)/2.at n=37A160749
- Positions in A181391 where the terms listed in A171863 appear.at n=19A171864
- Numbers n such that phi(n) divides Sum_{k=1..n} phi(k).at n=42A194855
- Composite numbers whose multiplicative persistence is 6.at n=5A199996
- Number of arrays of median of three adjacent elements of some length-5 0..n array, with no adjacent equal elements in the latter.at n=18A229013
- T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums and column sums nondecreasing.at n=23A267990
- Number of 3Xn arrays containing n copies of 0..3-1 with row sums and column sums nondecreasing.at n=4A267992
- Numbers k such that A019320(k) is in A217468.at n=24A297412
- Numbers k such that 2^m == 2 (mod m*(m-1)), where m=A019320(k).at n=35A297413