12079
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12384
- Proper Divisor Sum (Aliquot Sum)
- 305
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11776
- Möbius Function
- 1
- Radical
- 12079
- 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
- 42
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 88.at n=33A020427
- Denominators of continued fraction convergents to sqrt(335).at n=6A041633
- a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.at n=33A083690
- a(n) = -a(n-2) - a(n-3).at n=47A112455
- Numbers k such that 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)-1 and 6*p(k)*p(k+1)*p(k+2)*p(k+3)*p(k+4)+1 are twin primes with p(h) = h-th prime.at n=30A129310
- a(n) = -1 - 2*n + n^2 + 2*n^3 + n^4.at n=10A165568
- a(2n)=A165568(n). a(2n+1)=A165563(n).at n=20A171733
- Number of partitions of 2*n into parts with multiplicity <= n.at n=17A232623
- Cyclops numbers whose squares are cyclops numbers.at n=12A239827
- Number of (6+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=16A250660
- Number of (n+2) X (2+2) 0..1 arrays with no 3 x 3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2.at n=18A255222
- Number of partitions of the n-th n-gonal pyramidal number into distinct n-gonal pyramidal numbers.at n=48A337798
- Integers k for which A000594(k)^2 > 4 k^11, where A000594 is Ramanujan's tau function.at n=24A364087
- a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 5.at n=4A367246
- Least k such that the k-th prime number has exactly n ones in its binary expansion.at n=15A372517
- Sorted list of positions of first appearances in A014499 (number of ones in binary expansion of each prime).at n=15A372686