9585
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7695
- 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
- 5040
- Möbius Function
- 0
- Radical
- 1065
- Omega Function (Ω)
- 5
- 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
- yes
- 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
- Number of points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=37A005919
- [ exp(9/14)*n! ].at n=6A030918
- Denominators of continued fraction convergents to sqrt(611).at n=13A042173
- Number of 2-element intersecting families whose union is an n-element set.at n=8A053152
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=39A056754
- Nonprimes which terminate in their sum of prime factors.at n=32A071173
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=42A072016
- Number of primes less than 10^n with initial digit 1.at n=5A073517
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=86A119455
- Composite numbers n such that the sum of prime factors of n (counted with multiplicity) terminates n as a substring.at n=31A143993
- 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, -1, 0), (-1, 0, -1), (-1, 0, 1), (0, 1, 1), (1, -1, -1)}.at n=10A148219
- 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, -1, 0), (-1, 1, -1), (1, -1, -1), (1, 1, -1), (1, 1, 1)}.at n=8A149517
- Number of binary strings of length n with equal numbers of 01010 and 10001 substrings.at n=14A164262
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/sin(n) > a(k)/sin(a(k)), so that a(1)/sin(a(1)) > a(2)/sin(a(2)) > ... > a(k)/sin(a(k)) > ...at n=27A172445
- Pairs of deficient numbers having the same value of sigma(k)/k in the order that they are found.at n=34A211680
- Deficient numbers n having a companion m > n such that sigma(n)/n = sigma(m)/m.at n=17A212608
- Integer nearest f(10^n), where f(x) = Sum of ( mu(k) * H(k)/k^(3/2) * Integral Log(x^(1/k)) ) for k = 1 to infinity, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=4A226945
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=20A250755
- Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=0A250761
- Products of three distinct tribonacci numbers > 1.at n=27A274434