11154
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
- 24
- Divisor Sum
- 26352
- Proper Divisor Sum (Aliquot Sum)
- 15198
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3120
- Möbius Function
- 0
- Radical
- 858
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = A026615(2*n-1, n-1).at n=7A026619
- a(n) = A026615(n, floor(n/2)).at n=15A026621
- a(n) = n^3 + n^2 + n.at n=22A027444
- Numbers k such that 135*2^k+1 is prime.at n=43A032417
- Number of different sets ("cut sets") of triangles a regular (n+2)-gon can be dissected into; two triangulations of an (n+2)-gon are equal if all numbers of congruent triangles coincide.at n=17A033961
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=39A051869
- Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.at n=15A053476
- List of codewords in binary lexicode with Hamming distance 5 written as decimal numbers.at n=39A075931
- Smallest number m such that the trajectory of m under iteration of cototient function[=A051953] contains exactly n distinct numbers (including m and the fixed point=0). Or: the required number of iterations[=operations,transitions] is n-1.at n=22A098197
- a(n) = Sum_{k=1..A124259(n)} n^k.at n=21A124260
- Numbers that are divisible by the product of the digit-sums of their neighbors.at n=19A152826
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^3 < x^3 + y^3.at n=25A211650
- a(n) = n*(21*n-17)/2.at n=33A226491
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 475", based on the 5-celled von Neumann neighborhood.at n=24A272449
- a(n) = A273059(4n+2).at n=18A275918
- Smallest integer N such that all numbers from 1 to n (n being N's rank in the sequence) can be built by the sum of contiguous digits of N.at n=11A296447
- Partial sums of A008137.at n=27A299276
- a(n) = 3*p(n), where p(n) is the number of partitions of n.at n=28A299473
- Number of ways to choose a rooted partition of each part in a constant rooted partition of n.at n=24A301761
- E.g.f.: exp(-5) * Sum_{n>=0} (2*exp(n*x) + 3)^n / n!.at n=3A326437