9060
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25536
- Proper Divisor Sum (Aliquot Sum)
- 16476
- 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
- 2400
- Möbius Function
- 0
- Radical
- 4530
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 65
- 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
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=40A007333
- Ordered sequence of distinct terms of the form floor(Pi^i * floor(Pi^j)), i, j >= 0.at n=24A022767
- Number of partitions of n into prime power parts (1 excluded).at n=52A023894
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^4 *product_{i=1..t} (1-x^i) ).at n=21A059821
- Number of distinct values obtained using n ones and the operations of sum, product and quotient.at n=15A069765
- a(n) = A000217(A000217(n))-n^2.at n=16A086602
- Numbers k such that (2^127-1)*2^k + 1 is prime.at n=11A098126
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=18A101243
- a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=21A105213
- McKay-Thompson series of class 40B for the Monster group.at n=45A112179
- Fibonacci(p-J(p,5)) mod p^2, where p is the n-th prime and J is the Jacobi symbol.at n=35A113650
- sigma(n) + n is a square.at n=23A114069
- Terms of A068563 that are not terms of A124240.at n=37A124241
- Numbers k such that 2k+1, 4k+1, 6k+1 and 8k+1 are primes.at n=8A124409
- Numbers k such that 2*k+1, 4*k+1, 8*k+1 and 16*k+1 are primes.at n=11A124412
- Numbers n such that n!10-1 is prime.at n=28A204658
- Number of nX4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=5A207657
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=41A207661
- Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=3A207664
- Number of 2 X 2 matrices having all terms in {-n,...,0,..,n} and permanent=trace.at n=30A211145