6111
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10192
- Proper Divisor Sum (Aliquot Sum)
- 4081
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3456
- Möbius Function
- 0
- Radical
- 2037
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 93
- 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
- a(n) = floor( n*(n-1)*(n-2)/23 ).at n=53A011905
- Describe the previous term! (method B - initial term is 6).at n=2A022502
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (F(2), F(3), ...).at n=12A024589
- Expansion of Product_{m>=1} (1 + q^m)^m; number of partitions of n into distinct parts, where n different parts of size n are available.at n=17A026007
- Lucky numbers with size of gaps equal to 18 (upper terms).at n=34A031901
- a(n) = (2*n - 1)*(3*n + 1).at n=32A033569
- Euler transform of A027656(n-1).at n=26A035528
- Sums of 11 distinct powers of 2.at n=17A038462
- Numerators of continued fraction convergents to sqrt(435).at n=5A041828
- Numbers having three 1's in base 10.at n=32A043495
- Numbers whose base-4 representation contains exactly three 1's and four 3's.at n=2A045128
- a(n) is the number of integers whose sum of divisors is 6^n.at n=17A048253
- Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.at n=14A050410
- n satisfying sigma(n+1) = sigma(n-1).at n=14A055574
- Number of primitive (period n) periodic palindromic structures using a maximum of two different symbols.at n=26A056513
- Number of primitive (period n) periodic palindromic structures using exactly two different symbols.at n=25A056518
- Numbers k such that sigma(k-1) divides sigma(k+1).at n=18A067130
- Numbers k such that phi(k) divides (sigma(k+1) + sigma(k-1)).at n=33A067244
- Rounded total surface area of a regular octahedron with edge length n.at n=42A071396
- Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.at n=39A080510