9387
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
- 12
- Divisor Sum
- 15600
- Proper Divisor Sum (Aliquot Sum)
- 6213
- 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
- 5328
- Möbius Function
- 0
- Radical
- 3129
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- no
- Odd
- yes
Appears in sequences
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T4 atom.at n=12A019212
- Numerators of continued fraction convergents to sqrt(449).at n=6A041854
- Digitally balanced numbers in both bases 2 and 3.at n=38A049361
- Larger of Smith brothers.at n=6A050220
- Tribonacci numbers that start with first three cubes.at n=12A086213
- 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, -1), (-1, -1, 0), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}.at n=9A148678
- a(n) = 361*n + 1.at n=25A158310
- a(n) = 26*n^2 + 1.at n=19A158549
- Composite numbers n such that 8*n^2-2*n-1 divides the primitive part U(n) of Fibonacci(n).at n=19A159234
- Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences.at n=27A200274
- a(n) = (prime(n) - 1)*(prime(n+1) - 1)/2 + 3.at n=32A201498
- Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X 2 array.at n=17A219621
- The number of P-positions in the game of Nim with up to four piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n.at n=28A237686
- Number of Steinhaus graphs of order n and diameter 2.at n=11A246319
- Self numbers that are the product of two self numbers greater than one.at n=53A290574
- Irregular table read by rows: Take a nonagon with all diagonals drawn, as in A332421. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=29A332427
- a(n) = L(2*n+1)+4*n+2.at n=9A382656