11872
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
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 27216
- Proper Divisor Sum (Aliquot Sum)
- 15344
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4992
- Möbius Function
- 0
- Radical
- 742
- Omega Function (Ω)
- 7
- 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
- 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
- Expansion of e.g.f. arctan(exp(x)*log(x+1)).at n=7A012276
- a(n) = T(n,n-4), array T as in A055818.at n=18A055821
- Generalized sum of divisors function: third diagonal of A060047.at n=31A060046
- Let u be any string of n digits from {0,...,7}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-8 number; then a(n) = max_u f(u).at n=8A065849
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x^2)^n.at n=59A084606
- (n / product of digits of n) is a semiprime.at n=26A085773
- Number of Niven numbers <= 10^n.at n=4A140866
- a(n) = A000203(n) * A024916(n).at n=20A143238
- First bisection of A061039.at n=53A144448
- a(n) = A061039(8*n+5).at n=13A144453
- Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 101-111-101 pattern in any orientation.at n=14A146431
- Numbers k such that 3^(2*k-1)+3^k+1 is prime.at n=15A176008
- Numbers of the form 4^j + 6^k, for j and k >= 0.at n=41A226813
- Numbers of the form 6^j + 8^k, for j and k >= 0.at n=29A226824
- a(n) = Sum_{i=0..n} digsum_4(i)^4, where digsum_4(i) = A053737(i).at n=32A231667
- Numbers of the form 6^x + y^6 with x, y >= 0.at n=29A250547
- Number of (n+2)X(1+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=2A253986
- Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=0A253988
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=3A253993
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock diagonal median plus antidiagonal median nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=5A253993