9036
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 22932
- Proper Divisor Sum (Aliquot Sum)
- 13896
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3000
- Möbius Function
- 0
- Radical
- 1506
- 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
- 39
- Smith Number
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for MgZn2, Position Zn1.at n=24A009937
- Molien series for full 8 X 8 Siegel modular group H_3 of order 371589120.at n=39A027633
- Expansion of phi(x) / f(-x) in powers of x where phi(), f() are Ramanujan theta functions.at n=26A029552
- Expansion of Molien series for relative invariants of 8-dimensional complex Clifford group.at n=18A043330
- Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1<x<y<z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.at n=14A050793
- a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.at n=13A063492
- Number of vertically indecomposable distributive lattices on n nodes.at n=24A072361
- a(n) = n * [1 + sum(k=1 to n) prime(k)].at n=18A083725
- Partial sums of A087100.at n=24A087098
- The two digits touching the first comma have as absolute difference 0. The next such difference is 1. The next one is 2. Then 3, 4, 5... etc. When we reach 9 the differences start a new cycle: 0, 1, 2, 3... etc. Among many such possible sequences, this is the slowest increasing one starting with "1".at n=43A098795
- a(n) = phi(Padovan(n+4)).at n=35A107797
- Number of subsets of {1,2,....,n} with an arithmetic mean that is an integer and also a divisor of n.at n=17A114976
- a(n) = (p(n)*p(n+2) - p(n+1))/2, where p(n) is the n-th odd prime.at n=30A152531
- Numbers that are the sum of two reversed consecutive primes in more than one way.at n=23A162705
- Totally multiplicative sequence with a(p) = a(p-1) + 5 for prime p.at n=43A166702
- Smallest a(n) such that the prime factorization of a(n)! contains at least one factor to each exponent between 1 and n.at n=38A177442
- Smallest a(n) such that the prime factorization of a(n)! contains at least one factor to each exponent between 1 and n.at n=39A177442
- Number of 0..n arrays of length 6 with each element differing from at least one neighbor by 1 or less, starting with 0.at n=20A221685
- Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(1)x(2)... x(q) is the x(0)-th divisor of n.at n=26A234314
- Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or two plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240430