9485
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13056
- Proper Divisor Sum (Aliquot Sum)
- 3571
- 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
- 6480
- Möbius Function
- -1
- Radical
- 9485
- 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
- 153
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = Sum_{k=0..n} (k+1) * A026725(n, n-k).at n=10A027212
- Number of positive integers <= 2^n of form 7 x^2 + 7 y^2.at n=18A054186
- Partial sums of A002522, starting at n=1.at n=29A145066
- Half the number of nX4 binary arrays with no element equal to a strict majority of its king-move neighbors.at n=6A183383
- T(n,k)=Half the number of nXk binary arrays with no element equal to a strict majority of its king-move neighbors.at n=48A183386
- T(n,k)=Half the number of nXk binary arrays with no element equal to a strict majority of its king-move neighbors.at n=51A183386
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=18A208181
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2*w^2 < x^2 + y^2.at n=25A211800
- Partial sums of 3-almost primes which are again 3-almost primes, i.e., have exactly 3 not necessarily distinct prime factors.at n=15A217018
- Smallest number m such that 2^m contains a string of n consecutive increasing digits in its decimal representation.at n=7A238448
- Number of nX5 binary arrays with rows and columns lexicographically nondecreasing and row and column sums nonincreasing.at n=14A266544
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood.at n=49A270626
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 561", based on the 5-celled von Neumann neighborhood.at n=20A272937
- Expansion of Product_{k>=1} ((1-x^(4*k))/(1-x^k))^k.at n=16A285262
- Expansion of Product_{k>=1} (1 - (x/(1-x))^k)^k.at n=13A307574
- Numbers k such that 2^k + 3^k + 6 is prime.at n=31A354829
- E.g.f. A(x) satisfies 1 = Sum_{n>=0} ( A(x)^n + LambertW(-x) )^n / n!.at n=5A386648
- Triangle read by rows: T(n,k) = n! * coefficient of m^k in the polynomial counting labeled digraphs with m nodes and n arcs and without directed paths of length >= 2, with 0 <= k <= 2*n.at n=31A387663