11912
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22350
- Proper Divisor Sum (Aliquot Sum)
- 10438
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5952
- Möbius Function
- 0
- Radical
- 2978
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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) = floor( n*(n-1)*(n-2)/22 ).at n=65A011904
- Convolution of natural numbers >= 3 and Fibonacci numbers.at n=15A023552
- a(n) = (d(n)-r(n))/2, where d = A026060 and r is the periodic sequence with fundamental period (1,0,0,0).at n=43A026061
- Least term in period of continued fraction for sqrt(n) is 7.at n=21A031431
- Numbers k such that sigma(sigma(k) - k) = phi(sigma(k) + k).at n=11A074886
- Cycle of the inventory sequence (as in A063850) starting with n consists of prime numbers.at n=39A078970
- Number of partitions of n with more even parts than odd parts.at n=41A108949
- n(k) is the minimum n that requires at least k to make 2*Prime[n]+Prime[k] a prime.at n=46A114234
- Numbers k such that k^2 divides 15^k-1.at n=22A128395
- 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, 1, -1), (1, 0, 0), (1, 1, -1)}.at n=9A148398
- a(n) = 361*n - 1.at n=32A158308
- Numbers k such that k^3 divides 15^(k^2) - 1.at n=35A177915
- Number of nX4 binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=5A228656
- T(n,k)=Number of nXk binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=41A228660
- Number of 6 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.at n=3A228665
- Number of length n+5 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=34A255996
- Expansion of f(-x^3, -x^7) * f(x^4, x^6) / psi(-x)^2 in powers of x where psi(), f(,) are Ramanujan theta functions.at n=25A259393
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 801", based on the 5-celled von Neumann neighborhood.at n=22A273575
- a(n) = 1*2 - 3 + 4*5 - 6 + 7*8 - 9 + 10*11 - 12 + 13*14 - ... + (up to n).at n=46A319493
- Numbers k such that lcm(1,2,3,...,k)/23 equals the denominator of the k-th harmonic number H(k).at n=31A342351