5502
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 7170
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1560
- Möbius Function
- 1
- Radical
- 5502
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 173
- 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
- Generalized sum of divisors function.at n=48A002132
- Coordination sequence T1 for Zeolite Code MFS.at n=46A008173
- a(n) = n*(25*n - 1)/2.at n=21A022282
- a(n) = T(n, n-1), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 1.at n=11A026521
- a(n) = T(n,n-1), T given by A026536. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 1.at n=11A026538
- T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A027157.at n=10A027165
- a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026519.at n=5A027263
- a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026536.at n=5A027268
- a(n) = Sum_{k=0..m-1} T(n,k) * T(n,k+1), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.at n=5A027316
- Numbers having period-4 6-digitized sequences.at n=28A031197
- Number of partitions of n into parts not of the form 25k, 25k+4 or 25k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=32A036003
- Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) <= cn(2,5) = cn(4,5).at n=69A036866
- Number of self-avoiding closed walks from 0 of area n in strip Z X {0,1,2}.at n=10A038579
- Numbers with exactly 4 distinct palindromic prime factors.at n=10A046402
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= n/3.at n=30A048002
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-1)/3.at n=30A048015
- Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n+1)/3.at n=30A048048
- Matrix 10th power of partition triangle A008284.at n=39A050304
- Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...at n=14A061317
- Squarefree numbers sandwiched between a pair of twin primes.at n=41A070195