9396
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
- 3
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 25410
- Proper Divisor Sum (Aliquot Sum)
- 16014
- 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
- 3024
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 7
- 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
- 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
- a(n) = (2*n - 7)*n^2.at n=18A015242
- Number of partitions of n into parts not of the form 15k, 15k+6 or 15k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=35A035960
- Triangle with n >= k >= 0 where a(n,k) = 2^k*3^(n-k)*(C(n+1,0)+C(n+1,1)+...C(n+1,k)).at n=23A061929
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=39A072016
- Maximum sum of products of successive pairs in a permutation of order n+1.at n=29A101986
- a(1) is the least k such that j(1) = k*2*3 - 1 is the lesser of a twin prime pair; then for n > 1, a(n) is the least k greater than a(n-1) such that j(n) = k*j(n-1)*(j(n-1)+2) - 1 is the lesser of a twin prime pair.at n=4A107485
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.at n=51A114580
- Number of 3 X 3 symmetric matrices over Z(n) having determinant 0.at n=5A115223
- Numbers k such that k^4 contains a pandigital substring.at n=22A115934
- Position of largest coefficient of n-th self-composition of (x+x^2) for n>=0.at n=14A122893
- Numbers with 30 divisors.at n=41A137493
- a(n) = prime(prime(prime(n) - 1) - 1) - 1, where prime(n) = n-th prime.at n=43A141208
- Sums of prime points found in four grids in each corner of a square.at n=36A161190
- a(n) = Sum_{d|n} d*sigma(n/d)*sigma(d).at n=39A174468
- Products of form p^4*q^2*r where p, q and r are three distinct primes.at n=38A179669
- Monotonic ordering of set S generated by these rules: if x and y are in S then (x+1)(y+1) is in S, and 2 is in S.at n=40A192518
- a(n) = (A216363(n) - 1)/118.at n=18A216380
- Numbers divisible by the square of each digit.at n=40A225299
- Number of right triangles on a centered hexagonal grid of size n.at n=5A241225
- a(n) = 29*n^2.at n=18A244635