8550
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 24180
- Proper Divisor Sum (Aliquot Sum)
- 15630
- 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
- 2160
- Möbius Function
- 0
- Radical
- 570
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- 65
- 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
- Number of partitions of floor(7n/2) into n nonnegative integers each no more than 7.at n=17A001979
- Number of 2 X 2 matrices with entries mod n and nonzero determinant.at n=9A005353
- Expansion of 1/((1-6x)*(1-7x)*(1-8x)*(1-9x)).at n=3A028200
- Numbers k such that A174141(k) is divisible by k.at n=36A032581
- Triangle read by rows: matrix 4th power of the Stirling2 triangle A008277.at n=17A039812
- Numbers whose base-7 representation contains exactly four 3's.at n=23A043408
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2 and a(3) = 3.at n=16A049911
- Number of independent components for a Weyl tensor in n dimensions.at n=15A052472
- Numbers k such that 3*2^k + 5 is prime.at n=46A057913
- a(n) = prime(n) + n^3 + n^2 + 4n - 1.at n=19A060822
- Sum of terms in n-th group in A075352.at n=41A075356
- Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.at n=40A087427
- 3 times hexagonal numbers: a(n) = 3*n*(2*n-1).at n=38A094159
- A002415 and A052472 interlaced.at n=34A117651
- a(n) = floor(n*(n+2)*(n+4)*(n-6)/192).at n=36A117652
- Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005.at n=6A125016
- Product of the square matrix in A065941 and the column vector (1, 2, 3, ...)'.at n=14A131913
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=7.at n=25A135192
- 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), (0, 1, -1), (0, 1, 0), (1, 0, 0)}.at n=9A149820
- 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, -1), (-1, 1, 1), (1, 0, 0), (1, 1, 1)}.at n=7A150705