9065
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12996
- Proper Divisor Sum (Aliquot Sum)
- 3931
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 1295
- Omega Function (Ω)
- 4
- 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
- 122
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (n+1)*(n+3)*(n+8)/6.at n=35A000297
- Number of minimal covers of an n-set that cover exactly 3 points uniquely.at n=4A003467
- Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).at n=23A035347
- Digitally balanced numbers in both bases 2 and 3.at n=30A049361
- a(n) = n*(n+1)*(n^2+5*n+18)/24.at n=19A051744
- Local ranks of terms of A057122.at n=47A057124
- Coefficients in the series (1 + x - 4x^4 - 6x^6 - 8x^8 - 9x^9 - 10x^10 - 12x^12 - 14x^14 - ... )/(1 - 2x^2 - 3x^3 - 5x^5 - 7x^7 - 11x^11 - 13x^13 - ... ).at n=14A058357
- a(n) = 7*n^2 + 14*n.at n=34A067727
- a(n) = Sum_{i=1..n} C(i+2,3)^3.at n=3A086021
- Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^6-M)/5, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=24A096040
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=36A108403
- a(n) = Sum_{k=0..n} binomial(n+k,k)^3.at n=3A112028
- Number of domino tilings of a 9-pillow of order n.at n=8A112842
- Start with 1057 and repeatedly reverse the digits and add 2 to get the next term.at n=8A120215
- Numbers k such that 2*k+1, 3*k+2 and 4*k+3 are primes.at n=37A126955
- Alternating row sums of triangle A134146.at n=5A134148
- Numbers k such that 2*k+1, 3*k+2, 4*k+3 and 5*k+4 are primes.at n=10A138700
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 0010-1010-1111 pattern in any orientation.at n=10A146776
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=7A150567
- Numbers of the form 49*k, where 49*k+2 and 49*k-6 are both prime.at n=3A153779