9418
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15012
- Proper Divisor Sum (Aliquot Sum)
- 5594
- 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
- 4416
- Möbius Function
- -1
- Radical
- 9418
- Omega Function (Ω)
- 3
- 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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.at n=46A002569
- Molien series for A_10.at n=36A008633
- Number of partitions of n into at most 10 parts.at n=36A008639
- a(n) = Sum_{k=1..n} k*[ (n/k)*[ n/k ] ].at n=48A024932
- Number of partitions of n in which the greatest part is 10.at n=46A026816
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=26A045198
- T(2n-1,n) where T is the array in A054126.at n=5A054133
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=37A065213
- The first n binary digits found in decimal expansion of e form a prime.at n=11A065596
- Octo numbers (a polygonal sequence): a(n) = 5*n^2 - 6*n + 2 = (n-1)^2 + (2*n-1)^2.at n=43A079273
- Numbers n occurring in binary representation of n*(n+1)/2.at n=40A092734
- Iccanobirt numbers (7 of 15): a(n) = R(a(n-1)) + R(a(n-2)) + R(a(n-3)), where R is the digit reversal function A004086.at n=16A102117
- Numbers n for which 12n+1, 12n+5, 12n+7 and 12n+11 are primes.at n=44A123985
- a(n) = n*(8*n+5).at n=34A139277
- Partial sums of A139250.at n=36A160424
- Eight rooks and one berserker on a 3 X 3 chessboard. G.f.: (1 + x^2)/(1 - 4*x + x^2 + 2*x^3).at n=7A180143
- Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, five or six distinct values for every i,j,k<=n.at n=9A211530
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=27A217972
- Number of (n+1) X (6+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=0A235447
- T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.at n=15A235449