11550
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 48
- Divisor Sum
- 35712
- Proper Divisor Sum (Aliquot Sum)
- 24162
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2400
- Möbius Function
- 0
- Radical
- 2310
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 5
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
- 130
- 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 (1+6*x)/(1-4*x)^(7/2).at n=4A007744
- Multinomial coefficient n!/([n/3]![(n+1)/3]![(n+2)/3]!).at n=11A022916
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A014306.at n=35A024477
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A014306.at n=34A025097
- a(n) = 5*(n+1)*binomial(n+2, 5)/2.at n=6A027778
- a(n) = 7*(n+1)*binomial(n+2,7)/2.at n=4A027780
- Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=24A046358
- Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=12A046366
- T(n,n+3), array T as in A047120.at n=7A047128
- Numbers k such that phi(k) = phi(k - phi(k)).at n=42A051487
- Global ranks of terms of A057122: tells which terms of A014486 form rooted plane binary trees also when interpreted as codes for ordinary rooted planar trees.at n=36A057123
- Fifth column (m=4) of triangle A060098.at n=11A060100
- Bisection of triangle A060098: odd-indexed members of column sequences of A060098 (not counting leading zeros).at n=49A060556
- Fifth column (m=4) of triangle A060556.at n=5A060558
- a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m.at n=27A060735
- Coefficient triangle of certain polynomials N(4; m,x).at n=32A062264
- T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.at n=32A063007
- Seventh column of triangle A075500.at n=2A075915
- Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=6A076252
- Integers n for which the ratio phi(n)/pi(n) is smaller than for any subsequent n. Here phi(n) is Euler's totient function and pi(n) is the number of primes that are at most n.at n=17A080289