11835
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20592
- Proper Divisor Sum (Aliquot Sum)
- 8757
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6288
- Möbius Function
- 0
- Radical
- 3945
- 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
- 174
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=38A020445
- Expansion of Product_{m>=1} (1+q^m)^(-3).at n=36A022598
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 3 (mod 5).at n=56A035585
- McKay-Thompson series of class 32a for the Monster group.at n=36A107635
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1110-0111-0100 pattern in any orientation.at n=10A146731
- 3 times 11-gonal (or hendecagonal) numbers: a(n) = 3*n*(9*n-7)/2.at n=30A153783
- Half the difference between the larger and smaller term of the n-th amicable pair.at n=13A162884
- Pasquale's sequence: a(n) = 2a(n-1) + (-1)^n*floor(n/2), with a(1)=1.at n=13A177143
- Number of partitions of 2n into exactly 5 parts.at n=37A256309
- Number of partitions of 3n into at most 5 parts.at n=23A256525
- Half the difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933.at n=13A275470
- Numbers k such that A335660(k) = 2.at n=48A335662
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=34A372680
- Odd binary Niven numbers (A144302) k such that k/wt(k) is also an odd binary Niven number, where wt(k) = A000120(k) is the binary weight of k.at n=30A376618
- Triangle read by rows: T(n,k) is the number of partitions of a 4-colored set of n objects into exactly k parts with 0 <= k <= n.at n=40A382341