9186
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18384
- Proper Divisor Sum (Aliquot Sum)
- 9198
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3060
- Möbius Function
- -1
- Radical
- 9186
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=24A020417
- 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 94.at n=29A031592
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 4).at n=54A046767
- McKay-Thompson series of class 24H for Monster.at n=25A058578
- a(n) = min( x : x^3 + n^3 == 0 mod (x+n-1) ).at n=55A066486
- G.f. satisfies: A(x) = 1/(1 + x*A(x^4)) and also the continued fraction: 1 + x*A(x^5) = [1; 1/x, 1/x^4, 1/x^16, 1/x^64, ..., 1/x^(4^(n-1)), ...].at n=55A101914
- Triangle Q, read by rows, where column k of Q equals column 0 of Q^(k+1) and Q is equal to the matrix square of integer triangle P = A135880 such that column 0 of Q equals column 0 of P shift left.at n=22A135885
- Column 1 of triangle Q = A135885; also equals column 0 of Q^2.at n=5A135886
- Triangle, read by rows, equal to P^4, where triangle P = A135880; also equals Q^2, where triangle Q = P^2 = A135885.at n=15A135891
- Triangle, read by rows equal to the matrix product P*R^-1*P, where P = A135880 and R = A135894; P*R^-1*P equals triangle Q=A135885 shifted down one row.at n=29A135899
- 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, 0), (-1, -1, 1), (-1, 1, -1), (0, 0, 1), (1, 0, 0)}.at n=9A149816
- First differences of A016041.at n=30A164124
- Number of size n nonnegative integer arrays with new values introduced in increasing order from 0, and no 4 consecutive elements totalling n or more.at n=8A193059
- Numbers k such that 6k+1, 12k+1, 18k+1 and 36k+1 are all primes.at n=39A206024
- Even numbers k such that 6k+1, 12k+1, 18k+1, 36k+1 and 72k+1 are all primes.at n=5A206349
- a(n) is the number of digits in the decimal representation of the smallest power of n that contains eight consecutive identical digits.at n=37A217183
- a(n) is the number of digits in the decimal representation of the smallest power of n that contains nine consecutive identical digits.at n=37A217184
- Number of length n+7 0..2 arrays with at most two downsteps in every 7 consecutive neighbor pairs.at n=1A255621
- T(n,k)=Number of length n+k 0..2 arrays with at most two downsteps in every k consecutive neighbor pairs.at n=29A255622
- Number of length n+2 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=6A255624