12286
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18432
- Proper Divisor Sum (Aliquot Sum)
- 6146
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6142
- Möbius Function
- 1
- Radical
- 12286
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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
- yes
- Odd
- no
Appears in sequences
- Smallest number that requires n iterations of the bi-unitary totient function (A116550) to reach 1.at n=41A005424
- a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=24A027383
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=7A031844
- a(n) = 3*2^n - 2.at n=12A033484
- Sums of 12 distinct powers of 2.at n=24A038463
- Floor(X/Y) where X = concatenation of the (n+1)-st even number through the (2n)-th even number and Y = concatenation of first n even numbers.at n=13A067091
- Add 1, double, add 1, double, etc.at n=24A083416
- Index of the primes in A084163.at n=14A084164
- a(n) = 6*n^2 + 3*n + 1.at n=45A085473
- a(n) = (27*n^2 + 9*n + 2)/2.at n=30A093485
- a(n) = B(2*n, 2)/B(2*n) (see formula section).at n=6A096045
- Duplicate of A033484.at n=12A099018
- Start with 1, then alternately double or add 2.at n=24A099942
- Numbers k such that hcl(k,k) < hcl(k,k-1) where hcl(k,i) is the Huffman code length; see comments.at n=23A126269
- Smallest positive integer of the form 3k+1 such that all subsets of {a(1),...,a(n)} have a different sum.at n=13A139217
- Smallest number m such that exactly n editing steps (insert or substitute) are necessary to transform the binary representation of m into the least prime not less than m.at n=12A171402
- Sum of the numbers already removed (including the target number) in the first jump of a Sieve of Eratosthenes table.at n=25A179654
- Semiprime centered triangular numbers.at n=34A184481
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding three.at n=30A190040
- Expansion of x*(3*x^2+x+1)/((x-1)*(2*x-1)*(x+1)).at n=13A192033