11262
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22536
- Proper Divisor Sum (Aliquot Sum)
- 11274
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3752
- Möbius Function
- -1
- Radical
- 11262
- 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
- 161
- 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
- Position of n^3 + 9 in A024975.at n=46A024979
- Numbers whose base-4 representation contains exactly three 2's and four 3's.at n=4A045152
- McKay-Thompson series of class 30D for Monster.at n=34A058615
- a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.at n=10A058966
- The minimal number which has multiplicative persistence 6 in base n.at n=0A064870
- Numbers k such that Cyclotomic(k,k) (i.e., the value of k-th cyclotomic polynomial at k) is a prime number.at n=28A070519
- Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along antidiagonals (A069480).at n=26A072332
- Number of partitions of n in which the sequence of frequencies of the summands is nondecreasing.at n=38A100883
- Number of partitions of n such that multiplicities of parts are divisors of n.at n=35A100932
- a(n)= 7*a(n-1) -4*a(n-2) -45*a(n-3) +64*a(n-4) +55*a(n-5) -128*a(n-6) +52*a(n-7).at n=4A121803
- Index of first occurrence of n in A154404.at n=35A154952
- Nearest k to j such that k*(2^j-1)+1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence.at n=22A159585
- G.f: exp( Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^(n/d))^d ).at n=10A205480
- McKay-Thompson series of class 30D for the Monster group with a(0) = 2.at n=34A205962
- Numbers n such that n*2^521 - 1 is prime.at n=42A265498
- Partial sums of A033616.at n=28A299902
- Number of integer partitions of n whose multiplicities are weakly decreasing and span an initial interval of positive integers.at n=49A317082
- Number of words w of length n such that each letter of the ternary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=8A321839
- Number of distinct characteristic polynomials for 2 X 2 matrices with entries from {0, 1, ..., n}.at n=19A366448
- Number of winning positions for the next player (a, b, c) where 1 <= a, b, c <= n in "Divisor Nim" (see comments).at n=24A383226