11289
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 4263
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7280
- Möbius Function
- -1
- Radical
- 11289
- 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
- 205
- 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
- Numbers k such that 243*2^k+1 is prime.at n=24A032498
- Multiplicity of highest weight (or singular) vectors associated with character chi_63 of Monster module.at n=37A034451
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=24A060630
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=22A075764
- a(n) is the smallest integer such that A080383(a(n)) = n.at n=15A080393
- Numbers n such that the product of digits of n equals the concatenation of pi(d)'s where d runs through the digits of n.at n=12A097228
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=36A117725
- a(n)*a(n-9) = a(n-1)*a(n-8)+a(n-4)+a(n-5) with initial terms a(1)=...=a(9)=1.at n=25A133847
- 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, 1), (0, 0, 1), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=7A150644
- Numbers n such that 10^n - 93 is prime.at n=22A178531
- Numbers k such that 5^k + 3^k - 1 is prime.at n=5A180741
- Number of nondecreasing sequences of 3 1..n integers with no element dividing the sequence sum.at n=43A212870
- Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 2 X n array.at n=23A219382
- Least number k such that k^n + k +/- 1 are twin primes, or 0 if no such k exists.at n=20A248081
- Number of vector spaces of dimension n generated by n X n matrices over F(2) of rank one, up to multiplication on the right by an invertible matrix and multiplication on the left by another invertible matrix.at n=6A255382
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 97", based on the 5-celled von Neumann neighborhood.at n=26A270154
- a(n) = Sum_{k = n..2*n+1} k^2.at n=16A299646
- G.f. A(x) satisfies: 1/(1 - x) = A(x)*A(x^2)^2*A(x^3)^3*A(x^4)^4* ... *A(x^k)^k* ...at n=34A307648
- Number of integer partitions of n whose conjugate has the same median.at n=42A363220