11791
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12712
- Proper Divisor Sum (Aliquot Sum)
- 921
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10872
- Möbius Function
- 1
- Radical
- 11791
- 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
- 81
- 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
- [ exp(17/20)*n! ].at n=6A030853
- a(n) = floor(1/(n-1) * Sum_{k=1..n-1} a(k)^(n/k)), given a(0)=1, a(1)=3, a(2)=7.at n=9A079120
- Numbers n such that n^2 = 67*m^2 + 67*m + 1.at n=2A106175
- Number triangle read by rows: T(n,k) = Sum_{j=0..n-k} C(n+j,j+k)*C(n-j,k).at n=51A117207
- 3n^3 - 2n^2 + n - 1.at n=15A130885
- Sum of digits of n-th even perfect number.at n=19A138828
- Position of start of first appearance of n consecutive 0's in the binary expansion of Pi.at n=14A178708
- Position of start of first appearance of n consecutive 0's in the binary expansion of Pi.at n=15A178708
- Number of 4 X n binary arrays with rows lexicographically nondecreasing and columns lexicographically nondecreasing and row sums nondecreasing and column sums nonincreasing.at n=26A266937
- Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=12A299576
- G.f. A(x) satisfies: 1 = Sum_{n>=0} ( (1+x)^(n-1) - A(x)^n )^n.at n=6A304645
- Position of start of first run of exactly n zeros in the base-2 representation of Pi, or -1 if no such run exists.at n=15A378472