9188
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16086
- Proper Divisor Sum (Aliquot Sum)
- 6898
- 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
- 4592
- Möbius Function
- 0
- Radical
- 4594
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- Related to representation as sums of squares.at n=21A002292
- a(n) = floor(tau*a(n-1)) + a(n-2) with a(0)=0 and a(1)=2.at n=13A005829
- Number of strictly 2-dimensional one-sided polyominoes with n cells.at n=10A006758
- Number of lines through exactly 3 points of an n X n grid of points.at n=24A018810
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=35A020409
- Convolution of positive integers n with Lucas numbers L(k)(A000032) for k >= 4.at n=11A033814
- Number of 3 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (10;0) and (10;1).at n=10A099041
- a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=15A115943
- Number of permutations of length n which avoid the patterns 1432, 2143, 3124; or avoid the patterns 1432, 2314, 3142.at n=8A116793
- Numbers n such that n, n+1, n+2 and n+3 are products of exactly 3 primes.at n=39A124057
- Numbers k such that k and k^2 use only the digits 1, 3, 4, 8 and 9.at n=15A137031
- Number of subsets {x(1),x(2),...,x(k)} of {1,2,...,n} such that all differences |x(i)-x(j)| are distinct.at n=21A143823
- 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, 0, 0), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149211
- a(n) = 4*n^2 + 24*n + 8.at n=44A153642
- Erroneous version of A006758.at n=9A195741
- a(n) = floor((n+1)*(n-3)*(n-4)/12).at n=50A212772
- n - (sum of prime factors of n) is a positive square.at n=41A216894
- Number of (n+1) X (1+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=4A231413
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=14A231419
- Number of (5+1)X(n+1) 0..2 arrays with no element equal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=0A231424