12206
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19440
- Proper Divisor Sum (Aliquot Sum)
- 7234
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5728
- Möbius Function
- -1
- Radical
- 12206
- 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
- 156
- 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
- yes
- Odd
- no
Appears in sequences
- "DHK" (bracelet, identity, unlabeled) transform of 1,0,1,0,... (odd).at n=28A032243
- Number of partitions satisfying cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5).at n=36A039838
- Numerators of continued fraction convergents to sqrt(695).at n=6A042336
- Base-7 palindromes that start with 5.at n=20A043019
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=17A045156
- Numbers k such that k^256 + 1 is prime.at n=32A056995
- Numbers n such that phi(n) = phi(n-1) - phi(n-2).at n=10A066231
- (prime(n)*(prime(n+1)-1) + (prime(n)-1)*prime(n+1)) / 2.at n=27A099909
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}.at n=8A149440
- The A161671(n)-th partial sum of A161671.at n=31A161778
- Least positive integer m such that prime(m+n) divides 2^m - 1.at n=44A248626
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 49", based on the 5-celled von Neumann neighborhood.at n=26A270016
- a(n) = Sum_{k=0..floor(2*n/5)} (k+1) * binomial(k,2*n-5*k).at n=33A392268
- a(n) = Sum_{k=0..floor(3*n/5)} (k+1) * binomial(k,3*n-5*k).at n=22A392311