9320
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21060
- Proper Divisor Sum (Aliquot Sum)
- 11740
- 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
- 3712
- Möbius Function
- 0
- Radical
- 2330
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of cos(sin(log(1+x))).at n=8A009036
- a(n) = (d(n)-r(n))/2, where d = A026046 and r is the periodic sequence with fundamental period (0,1,0,1).at n=34A026047
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 11 (most significant digit on left).at n=31A029456
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 47.at n=29A031545
- Triangular array T(n,k) giving the number of labeled even graphs with n nodes and k edges for n >= 0 and 0 <= k <= n*(n-1-[0 == n mod 2])/2 (with no trailing zeros).at n=65A054669
- Numbers k such that 7*2^k - 3 is prime.at n=30A058593
- McKay-Thompson series of class 44A for Monster.at n=51A058679
- Numbers n such that the area of the parallelogram formed by the vectors (n, prime(n)) and (n+1, prime(n+1)) is an integer square, i.e., Det[{{n, prime(n)},{n+1, prime(n+1)}}] is an integer square.at n=36A067805
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=18A078612
- (1/p)*(F(2p)-F(p)) where p runs through the primes and F(k) denotes the k-th Fibonacci number.at n=5A086546
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=44A101243
- Period of the Lucas 4-step sequence A073817 mod prime(n).at n=23A106296
- a(n) = 250*n - 180.at n=38A154360
- Right edge of triangular table A138612.at n=28A166019
- Numbers with distinct digits appearing in partition of decimal expansion of e (A001113).at n=32A167836
- a(n) = Sum_{d|n} A007955(d) * A000027(d) = Sum_{d|n} A007955(d) * (d), where A007955(m) = product of divisors of m.at n=20A174933
- Irregular triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k isolated fixed points.at n=37A184178
- a(n) = Sum_{i+j=n, i,j >= 1} tau(i)*sigma(j), where tau() = A000005(), sigma() = A000203().at n=56A191831
- Number of 4 X n 0..1 arrays avoiding 0 0 1 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically.at n=7A207255
- Number of (n+1)X(2+1) 0..1 arrays with the sum of each 2X2 subblock two extreme terms minus its two median terms lexicographically nondecreasing rowwise and columnwise.at n=4A235550