11924
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
- 12
- Divisor Sum
- 22848
- Proper Divisor Sum (Aliquot Sum)
- 10924
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5400
- Möbius Function
- 0
- Radical
- 5962
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- Series for first parallel moment of hexagonal lattice.at n=7A006736
- Series for radius of gyration for lattice animals on square lattice.at n=4A056261
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=34A091854
- Start with any initial string of n numbers s(1), ..., s(n), with s(1) = 2, other s(i)'s = 2 or 3 (so there are 2^(n-1) starting strings). The rule for extending the string is this as follows: To get s(n+1), write the string s(1)s(2)...s(n) as xy^k for words x and y (where y has positive length) and k is maximized, i.e., k = the maximal number of repeating blocks at the end of the sequence. Then a(n) = number of starting strings for which k > 1.at n=14A093370
- Numbers k such that 10^k + 2*R_k + 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A102930
- a(n) = 2^n - A122536(n).at n=13A121880
- Expansion of (1-x-3*x^2-sqrt(1-2*x-5*x^2+2*x^3+x^4))/(2*x^3*(1+2*x)).at n=10A190156
- Number of partitions p of n such that 2*(number of even numbers in p) < (number of odd numbers in p).at n=43A241651
- Number of n-node unlabeled rooted trees with thickening limbs and root outdegree (branching factor) 3.at n=26A245143
- Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=11A254904
- a(n) = (A242804(n)-9)/12.at n=1A257044
- Expansion of f(-x^8)^2 / f(-x) in powers of x where f() is a Ramanujan theta function.at n=37A260164
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=25A270327
- Numbers n such that Bernoulli number B_{n} has denominator 690.at n=17A272186
- The length of the longest initial sequence of the form UHUH..., summed over all bargraphs having semiperimeter n (n>=2).at n=9A274495
- Least number x such that x^n has n digits equal to k. Case k = 9.at n=16A285456
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=13A345593
- Numbers that are the sum of nine fourth powers in exactly nine ways.at n=12A345851
- Total number of parts coprime to n in the partitions of n into 9 parts.at n=34A363327