11838
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23688
- Proper Divisor Sum (Aliquot Sum)
- 11850
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3944
- Möbius Function
- -1
- Radical
- 11838
- Omega Function (Ω)
- 3
- 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
- 174
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Denominators of successive convergents to continued fraction 1/(2+2/(3+3/(4+4/(5+5/(6+6/(7+7/(8+8/9+...))))))).at n=6A053520
- Numbers which are the sum of their proper divisors containing the digit 9.at n=34A059468
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,9.at n=16A064241
- Least positive k such that k * Z^n + 1 is prime, where Z = 10^100+267, the first prime greater than a googol.at n=27A108344
- Smallest m such that A123699(m) = n.at n=17A123700
- Triangle, read by rows, where row n equals the inverse binomial transform of column n in the rectangular table A124530.at n=38A124539
- A leading coefficient adjusted symmetrical triangle of polynomial coefficients based on:p(x,n)=Sum[k!*Binomial[x, k], {k, 0, n}].at n=38A176664
- A leading coefficient adjusted symmetrical triangle of polynomial coefficients based on:p(x,n)=Sum[k!*Binomial[x, k], {k, 0, n}].at n=42A176664
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 291", based on the 5-celled von Neumann neighborhood.at n=25A271131
- a(n) = the smallest k such that Fibonacci(k) begins and ends with n, where Fibonacci(k) > n, or -1 if there are none.at n=43A374026