15950
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33480
- Proper Divisor Sum (Aliquot Sum)
- 17530
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- 0
- Radical
- 3190
- 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
- 146
- 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*(2*n^2 + n + 1)/2.at n=24A085786
- Numbers n such that the numerator of Sum_{i=1..n} (1/i^2), in reduced form, is prime.at n=30A111354
- a(1)=2^3*5*7*29=8120; for n>1, a(n) = (-1)sigma(a(n-1)).at n=7A126602
- a(1)=2^3*5*7*29=8120; for n>1, a(n) = (-1)sigma(a(n-1)).at n=15A126602
- a(1)=2^3*5*7*29=8120; for n>1, a(n) = (-1)sigma(a(n-1)).at n=23A126602
- a(1)=2^3*5*7*29=8120; for n>1, a(n) = (-1)sigma(a(n-1)).at n=31A126602
- Largest integer terms forming a self-convolution fifth-root of a sequence (A132839) such that: A132839(n) <= 5*A132839(n-1) for n>0 with A132839(0)=1.at n=8A132840
- a(n) = 5*p^5 + 3*p^3 - 2*p^2, where p = prime(n).at n=2A133063
- a(n) = 5*n^5 + 3*n^3 - 2*n^2. Coefficients and exponents are the prime numbers in decreasing order.at n=5A134632
- a(1)=1, a(n)=a(n-1)+n^2 if n odd, a(n)=a(n-1)+ n^4 if n is even.at n=10A140150
- a(n) = 2662*n - 22.at n=5A157609
- -10-Knödel numbers.at n=48A225514
- Magic sums of 4 X 4 magic squares composed of squares.at n=29A271580
- The smallest k >= 0 that can be represented as a linear combination of 1^2, 2^2, ..., n^2 with coefficients +-1 and that cannot be represented using 1^2, 2^2, ..., m^2 with 1<=m<n.at n=38A392127