11774
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20904
- Proper Divisor Sum (Aliquot Sum)
- 9130
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4872
- Möbius Function
- 0
- Radical
- 406
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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
- a(n) = n*(n+1)^2/2.at n=28A006002
- Normalized volume of center slice of n-dimensional cube: 2^n* n!*Vol({ (x_1,...,x_n) in [ 0,1 ]^n: n/2 <= Sum_{i = 1..n} x_i <= (n+1)/2 }).at n=5A011818
- Smallest order m > 0 for which there are n nonisomorphic finite groups of order m, or 0 if no such order exists.at n=30A046057
- Least k for which the integers Floor(k/m^2) for m=1,2,...,n are distinct.at n=32A054062
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k.at n=26A057214
- a(n) = n*(2*n+1)^2.at n=14A084367
- Group the natural numbers such that the n-th group sum is divisible by the n-th triangular number: (1), (2, 3, 4), (5, 6, 7), (8, 9, 10, 11, 12), (13, 14, 15, 16, 17), (18, 19, 20, 21, 22, 23, 24), ... Sequence contains the group sum.at n=27A086500
- a(n) = (prime(n)^4 - 1) / 240.at n=9A089034
- Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] variables is between k and k+1.at n=35A101842
- Triangle read by rows: T(n,k), for k=-n..n-1, is the scaled (by 2^n n!) probability that the sum of n uniform [-1, 1] variables is between k and k+1.at n=36A101842
- Triangle formed by left half of A101842, read by rows.at n=20A101845
- Triangle formed by right half of A101842, read by rows.at n=15A102012
- a(n) = J_4(n)/240.at n=35A115002
- Numbers k such that tau(k) = tau(k+1) mod 691, where tau is Ramanujan's tau function A000594.at n=14A121733
- Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).at n=28A132633
- Consider the first run of composites that contains at least two numbers whose largest prime factor is prime(n), n >= 2. a(n) is the second of these numbers.at n=8A137800
- a(n) = (p^3 - p^2)/2, where p = prime(n).at n=9A138416
- a(n) = 14*n^2.at n=29A144555
- Number of binary strings of length n with equal numbers of 00101 and 01010 substrings.at n=14A164245
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-2.at n=26A180292