9037
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10336
- Proper Divisor Sum (Aliquot Sum)
- 1299
- 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
- 7740
- Möbius Function
- 1
- Radical
- 9037
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor( n*(n-1)*(n-2)/29 ).at n=65A011911
- n is equal to the number of 3s in all numbers <= n written in base 5.at n=12A014895
- Numbers k such that the decimal part of k^(1/9) starts with a 'nine digits' anagram.at n=4A034284
- Partition numbers rounded to nearest integer given by the Hardy-Ramanujan approximate formula.at n=31A050811
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 16.at n=31A050965
- Inverse Moebius transform of 5-simplex numbers A000389.at n=13A101289
- Start with 1 and repeatedly reverse the digits and add 36 to get the next term.at n=14A118536
- E.g.f. sec(x)/(1-x) = 1/( cos(x) * (1-x) ).at n=7A159039
- If, for some m, A098550(m-2) is a prime p and A098550(m) = 7p, add 7p to the sequence.at n=42A253054
- Numbers n such that the average of the positive divisors of n is a Fibonacci number.at n=32A272440
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 499", based on the 5-celled von Neumann neighborhood.at n=22A272562
- Number of n X 5 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=6A301538
- Number of nX7 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=4A301540
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=59A301541
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=61A301541
- Starting from 1, successively take the smallest "Choix de Bruxelles" with factor 13 which is not already in the sequence.at n=12A360190
- L.g.f.: log( Sum_{k>=0} x^(k^3) ).at n=55A363783
- Least number with exactly n distinct divisors of prime indices. Position of first appearance of n in A370820.at n=17A371131
- Sorted list of positions of first appearances in the sequence A370820, which counts distinct divisors of prime indices.at n=25A371181
- Consecutive states of the linear congruential pseudo-random number generator (967*s + 3041) mod 14406 when started at s=1.at n=30A385078