7868
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
- 12
- Divisor Sum
- 15792
- Proper Divisor Sum (Aliquot Sum)
- 7924
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 3934
- 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
- 101
- 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) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=13A000441
- Number of partitions of n into parts of 3 kinds.at n=12A000716
- a(1) = 2; a(n+1) = a(n)-th nonprime, where nonprimes begin at 1.at n=32A025003
- Numbers with multiplicative persistence value 6.at n=4A046515
- a(n) = 10*n^2+n.at n=27A055437
- Numbers n such that n | sigma_10(n).at n=44A055714
- a(n) is the smallest number not already used such that a(n)*a(n-1)*a(n-2) + 1 is a square, with a(1)=1 and a(2)=2.at n=23A064691
- Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.at n=25A065069
- Antidiagonal sums of triangle A099602, in which row n equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907).at n=16A099604
- Numbers n such that pi(n^2)=pi((n-k)^2)+n, where k=A000193(n).at n=33A137271
- Number of nondecreasing arrangements of n numbers in -3..3 with sum zero and sum of squares not greater than n*12/3.at n=23A183921
- Number of n X n binary arrays without the pattern 0 1 0 vertically or horizontally.at n=3A188767
- Number of nX4 binary arrays without the pattern 0 1 0 vertically or horizontally.at n=3A188769
- T(n,k)=Number of nXk binary arrays without the pattern 0 1 0 vertically or horizontally.at n=24A188774
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n with k horizontal segments.at n=70A191390
- Composite numbers whose multiplicative persistence is 6.at n=4A199996
- Numbers k such that A206369(k) = A206369(k + 1).at n=16A206368
- Number of 0..6 arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo 7.at n=5A207098
- T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its two previous neighbors modulo (k+1).at n=60A207100
- Number of 0..n arrays x(0..5) of 6 elements with each no smaller than the sum of its two previous neighbors modulo (n+1).at n=5A207103