9500
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21840
- Proper Divisor Sum (Aliquot Sum)
- 12340
- 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
- 3600
- Möbius Function
- 0
- Radical
- 190
- Omega Function (Ω)
- 6
- 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
- 166
- 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
- Hexagonal pyramidal numbers, or greengrocer's numbers.at n=24A002412
- Expansion of 1/((1-x)^4*(1+x)).at n=46A002623
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=37A014112
- Even hexagonal pyramidal numbers.at n=11A015226
- a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2).at n=46A023855
- Row sums of convolution triangle A030523.at n=7A039717
- Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.at n=39A046851
- Number of walks of length n between opposite vertices on a triangular prism.at n=10A094556
- Least multiple of n such that every partial concatenation followed by a 1 is prime.at n=49A111436
- a(0)=1; for n > 0, a(n) = a(n-1) + a(prime(n)(mod n)), where prime(n) is the n-th prime.at n=47A127066
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 5 and 9.at n=39A136826
- Numbers k such that k and k^2 use only the digits 0, 2, 3, 5 and 9.at n=35A136891
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 9.at n=34A136901
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=20A136914
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 7 and 9.at n=27A136917
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 8 and 9.at n=13A136919
- Numbers k such that k and k^2 use only the digits 0, 2, 5 and 9.at n=12A136920
- A triangular sequence of polynomial coefficients: {a,b,c,d}={4, 5, 5, 0}; p(x,n)=(-1)^(n)*(1 - d - c x)^(n + 1)*Sum[(a*k + b)^n*(c*x + d)^k, {k, 0, Infinity}].at n=13A154630
- Row sums of triangle T(j,k) = (j^k) mod (j*k) for 1 <= k <= j (see A096133).at n=37A157351
- Partial sums of A002620.at n=48A173196