7935
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13272
- Proper Divisor Sum (Aliquot Sum)
- 5337
- 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
- 4048
- Möbius Function
- 0
- Radical
- 345
- 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
- 127
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12).at n=28A017825
- Numbers k such that 161*2^k+1 is prime.at n=17A032457
- Sums of 12 distinct powers of 2.at n=4A038463
- Numbers m such that there are precisely 3 groups of order m.at n=35A055561
- Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 5 labeled nodes.at n=8A060535
- a(n) = 15*n^2.at n=23A064761
- Composite numbers k+1 such that k*phi(k+1) is a perfect square.at n=17A069068
- Number of Bottleneck-Monge matrices with 2 rows. In the formula below, P = 2.at n=8A070050
- Number of Bottleneck-Monge matrices with 9 rows.at n=1A070057
- Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.at n=32A090424
- Number of those nonnegative integer solutions of the congruence x_1+2x_2+...+(n-1)x_{n-1} = 0 (mod n) which are indecomposable, that is, are not nonnegative linear combinations of other nonnegative integer solutions.at n=18A096337
- Ramanujan numbers (A000594) read mod 23^3.at n=19A126847
- Numbers m such that m^k does not divide the denominator of the m-th generalized harmonic number H(m,k) nor the denominator of the m-th alternating generalized harmonic number H'(m,k), for k = 6.at n=32A128676
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=15A143035
- a(n) = 256*n - 1.at n=30A158250
- Integers of the form A164577(k)/3.at n=21A164619
- Triangle read by rows, A084938 * A165489 diagonalized as an infinite lower triangular matrix.at n=50A165490
- Totally multiplicative sequence with a(p) = 8p-1 for prime p.at n=17A166657
- E.g.f.: x = Sum_{n>=1} a(n)*x^n/n! * exp(-n*(n+1)/2*x).at n=4A195737
- Number of (w,x,y) with all terms in {0,...,n} and w>floor((x+y)/3).at n=22A212974