9693
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
- 8
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 4707
- 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
- 6444
- Möbius Function
- 0
- Radical
- 1077
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Convolution of odd numbers and A000201.at n=25A023658
- Convolution of odd numbers and A001950.at n=21A023659
- Number of partitions of n into parts not of the form 21k, 21k+6 or 21k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=34A035984
- Numbers k such that 199*2^k-1 is prime.at n=37A050851
- Numbers k such that k^18 == 1 (mod 19^3).at n=26A056089
- a(1) = 1; then the smallest number such that both the forward and reverse n-th partial concatenation is a prime for n > 1. (Reverse concatenation is taken term-wise and not digit-wise.)at n=28A083992
- Numbers m such that m#*2^m + 1 is prime, where m# = A002110(m).at n=15A091424
- a(n) = 3*a(n-1) + 2*a(n-3), with a(0)=1, a(1)=3.at n=8A098589
- a(n) = Sum_{k=0..floor(n/6)} binomial(n-3k,3k).at n=22A100134
- Matrix square of triangle A107876; equals matrix product of triangles: A107876^2 = A107862^-1*A107870 = A107867^-1*A107873.at n=28A107880
- Column 0 of triangle A107880.at n=7A107881
- Where records occur in A111390.at n=24A114111
- Triangle, read by rows, where row n equals the inverse binomial transform of column n in the rectangular table A124530.at n=39A124539
- 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), (0, 1, 1), (1, -1, 1), (1, 0, -1)}.at n=8A149041
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209169; see the Formula section.at n=48A209168
- The Wiener index of the graph obtained by applying Mycielski's construction to the crown graph G(n) (n>=3).at n=24A228598
- Squares of triangular numbers, written backwards.at n=34A229701
- Smallest number m such that the n-th prime is the median prime factor of 1..m, cf. A212300.at n=42A246430
- Number of (2+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=17A250757
- Least positive integer k with p(prime(k))+p(prime(k*n)) prime, where p(.) is the partition function given by A000041.at n=36A261513