11915
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14304
- Proper Divisor Sum (Aliquot Sum)
- 2389
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9528
- Möbius Function
- 1
- Radical
- 11915
- 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
- 143
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k^2 + k + 1 is a palindrome.at n=17A028413
- Indices of terms in the sequence 3, 1, 4, 5, 9, 14, 23, ... (A000285 prefixed with 3) which are prime numbers.at n=41A091158
- a(n) = gcd(a(n-1),n-1)*a(n-1) + d(n-1) if a(n-1) is not divisible by 2, otherwise a(n) = a(n-1)/2, where gcd denotes common divisor, d(n) is number of divisors of n.at n=42A133904
- Binomial transform of [1, 4, 6, 4, 1, 1, -1, 1, -1, 1, ...].at n=19A140227
- Number of unlabeled acyclic graphs covering n vertices.at n=15A144958
- 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, -1, -1), (-1, -1, 1), (0, 0, 1), (0, 1, 1), (1, 1, 0)}.at n=7A151067
- Expansion of (1 - 2*x - 2*x^2 + 3*x^3 + x^5)/((1-x)*(1-2*x-x^2)*(1-2*x^2-x^4)).at n=13A193530
- Number of partitions of 2n into parts such that the largest multiplicity equals n.at n=44A232697
- a(n) = floor(4^n/(2+2*cos(2*Pi/7))^n).at n=45A240671
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=5A316178
- Number of n X 6 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=2A316181
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=30A316183
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=33A316183
- Number of integer partitions of the n-th Fermi-Dirac prime into Fermi-Dirac primes.at n=21A316210
- Numbers k such that lcm(1,2,3,...,k)/23 equals the denominator of the k-th harmonic number H(k).at n=34A342351
- Number of non-weakly alternating integer compositions of n.at n=15A349053
- Discriminants of imaginary quadratic fields with class number 38 (negated).at n=35A351676
- a(n) is the number of ways n can be calculated with expressions of the form "d1 o1 d2 o2 d3 o3 d4" where d1-d4 are decimal digits (0-9) and o1-o3 are chosen from the four basic arithmetic operators (+, -, *, /).at n=5A357272
- Number of integer partitions of n whose distinct parts have non-integer median.at n=39A360689