9026
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13542
- Proper Divisor Sum (Aliquot Sum)
- 4516
- 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
- 4512
- Möbius Function
- 1
- Radical
- 9026
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 184
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Number of paraffins.at n=33A005999
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=34A034857
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+9 or 24k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=47A036033
- Position where n (presumably) appears the last time in A107261, or 0 if n keeps appearing.at n=12A107262
- a(n) is the number of nonnegative integers k less than 10^n such that the decimal representation of k lacks at least one of the digits 1,2 and at least one of the digits 3,4,5,6,7,8,9.at n=3A125880
- Semiprimes of the form k^2+1.at n=42A144255
- a(n) = 81*n^2 - 72*n + 17.at n=11A154277
- a(n) = 361*n + 1.at n=24A158310
- a(n) = 9*n^2 - 6*n + 2.at n=31A185939
- Semiprimes which are one more than a perfect power.at n=49A189047
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,4,2,0,1 for x=0,1,2,3,4.at n=12A196858
- Beach-Williams Pell numbers of type k^2 + 1.at n=9A212082
- Number of nXnXn triangular 0..3 arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value.at n=7A215177
- T(n,k)=Number of nXnXn triangular 0..k arrays with every horizontal row nondecreasing, first elements of rows nonincreasing, last elements of rows nondecreasing, and every row having the same average value.at n=52A215182
- Numbers k such that distances from k to three nearest squares are three triangular numbers.at n=16A232501
- Number of length n+4 0..7 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=3A249655
- T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=48A249656
- Number of length 4+4 0..n arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=6A249660
- Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=19A271311
- Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=8A298292