12095
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 3025
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9280
- Möbius Function
- -1
- Radical
- 12095
- 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
- 94
- 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
- a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1).at n=28A037165
- Denominators of continued fraction convergents to sqrt(479).at n=8A041915
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.at n=41A065148
- The sum of the non-divisors of n (less than n) is a multiple of the sum of the divisors of n.at n=15A066860
- Numbers k such that sum of the divisors d of k divides 1 + 2 + ... + k = k(k+1)/2.at n=17A076617
- Number of even cycles in range [A014137(n-1)..A014138(n-1)] of permutation A057505/A057506, with two fixed-points of A057164.at n=17A081160
- Number of even cycles in range [A014137(2n)..A014138(2n)] of permutation A057505/A057506, with two fixed-points of A057164.at n=8A081161
- Recurrence sequence based on positions of digits in decimal places of gamma, the Euler-Mascheroni constant.at n=31A098321
- A vector sequence with set row sum function: row(n)=(2*n)!/n! and linear build up and decline function: f(n,m)=Floor[(m/n)*row(n)].at n=17A152971
- A vector sequence with set row sum function: row(n)=(2*n)!/n! and linear build up and decline function: f(n,m)=Floor[(m/n)*row(n)].at n=18A152971
- a(n) = 576*n - 1.at n=20A158372
- a(n) = 25*n^2 - 5.at n=21A158446
- Table of triangular arguments such that if A002262(14*k) = "r" then the product A182431(k,i + 1) * A182431(k,i + 2) equals "r" + A000217(a(k,i)).at n=15A182102
- Numbers n not divisible by 2 or 3 such that k^k == k+1 (mod n) has no nonzero solutions.at n=52A191834
- Total number of parts k in all partitions of n such that k does not divide n.at n=26A209313
- Numbers k such that 6*3^k + 1 is prime.at n=26A216888
- Number of n X 2 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two exactly once.at n=9A268783
- Number of ternary strings of length n with maximal run length four containing 11112.at n=7A269916
- P-positions for the subtraction game whose allowed moves are the practical numbers (A005153).at n=33A275432
- Composite numbers k coprime to 13 such that k divides A006190(k-Kronecker(13,k)).at n=9A327653