5980
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 8132
- 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
- 2112
- Möbius Function
- 0
- Radical
- 2990
- Omega Function (Ω)
- 5
- 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
- 49
- 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) = Sum_{k=1..n-1} lcm(k,n-k).at n=40A006580
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=27A024599
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=26A025113
- a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2*n-1) = 4. Also a(n) = T(2*n-1,n-1), where T is defined in A026022.at n=7A026026
- T(n,[ n/2 ]), where T is defined in A026022.at n=15A026034
- Expansion of 1/((1-3x)(1-6x)(1-7x)(1-10x)).at n=3A028076
- Numbers k whose decimal representation, read as a base-23 value and divided by k, yields an integer.at n=20A032577
- Number of partitions of n into parts not of forms 4*k+2, 20*k, 10*k+5.at n=47A036026
- Denominators of continued fraction convergents to sqrt(313).at n=9A041591
- Denominators of continued fraction convergents to sqrt(894).at n=7A042729
- T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.at n=31A050158
- T(n,k) = S(2n-1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=40A050159
- Matrix 6th power of partition triangle A008284.at n=47A050300
- Numbers having exactly three prime gaps in their factorization.at n=32A073495
- Fourth diagonal (m=3) of triangle A084938; a(n) = A084938(n+3,n) = (n^3 + 9*n^2 + 26*n)/6.at n=30A092286
- A094536/2.at n=14A094537
- Number of partitions of n such that the least part occurs exactly five times.at n=43A097093
- Iccanobirt numbers (3 of 15): a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)), where R is the digit reversal function A004086.at n=15A102113
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k ascents of length 2.at n=31A102402
- Values of y in x^2 - 49 = 2*y^2.at n=12A106526