7845
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12576
- Proper Divisor Sum (Aliquot Sum)
- 4731
- 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
- 4176
- Möbius Function
- -1
- Radical
- 7845
- 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
- 176
- 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
- no
- Odd
- yes
Appears in sequences
- Sum of 10 nonzero 8th powers.at n=16A003388
- T(n,n-3), array T as in A038792.at n=36A038793
- Number of 5-block tricoverings of an n-set.at n=3A060483
- Triangle T(n,k) of k-block tricoverings of an n-set (n >= 3, k >= 4).at n=16A060487
- a(n) = n*A001865(n).at n=4A063169
- Row sums of the number triangle A098505.at n=18A098506
- Number of strings of numbers x(i=1..n) in 0..6 with sum i^3*x(i)^2 equal to n^3*36.at n=9A184300
- O.g.f.: Sum_{n>=0} 5*(n+5)^(n-1)*x^n/(1+n*x)^n.at n=5A195257
- Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,3,1,1,0 for x=0,1,2,3,4.at n=4A197496
- Number of nX5 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,3,1,1,0 for x=0,1,2,3,4.at n=4A197500
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,3,1,1,0 for x=0,1,2,3,4.at n=40A197503
- Numbers n such that prime(n) + reversal(prime(n)) is a square.at n=10A227371
- Number of (n+1) X (1+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=8A231799
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical, diagonal and antidiagonal neighbors equal to one.at n=36A231806
- Numbers k whose decimal expansion can be split into at least two parts whose binary equivalents can be concatenated (in the same order) to form the binary expansion of the original number k.at n=5A237041
- Number of partitions of n such that no part is a prime divisor of n.at n=38A237125
- Number of n-bit numbers that can be written as the concatenation of 0 or more prime numbers (everything written in base 2).at n=15A246807
- Numbers k such that the average of greatest prime factors of all positive integers <= k is an integer.at n=10A303659
- Triangle read by rows: T(n,k) is the number of chiral pairs of color loops of length n with exactly k different colors.at n=32A305541
- Number of chiral pairs of color loops of length n with exactly 5 different colors.at n=7A305544