8548
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 14966
- Proper Divisor Sum (Aliquot Sum)
- 6418
- 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
- 4272
- Möbius Function
- 0
- Radical
- 4274
- 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
- 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 connected graphs with n nodes, n+2 edges.at n=9A001436
- Number of polyhexes of class PF2 (with two catafusenes annealated to pyrene).at n=5A026118
- Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).at n=74A046742
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=26A048189
- Number of n X n binary matrices under action of dihedral group of the square D_4.at n=4A054247
- Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1).at n=87A054923
- Numbers k such that k^18 == 1 (mod 19^3).at n=23A056089
- McKay-Thompson series of class 21C for the Monster group.at n=21A058565
- Number of partitions of n into numbers having in binary representation at most trailing zeros.at n=39A087750
- Numbers k such that numerator of Bernoulli(2*k) is divisible by 37 and 59, the first two irregular primes.at n=34A092231
- Number of partitions of 2n free of multiples of 5. All odd parts occur with multiplicity 2 or 4. the even parts occur at most twice.at n=32A103257
- Integer part of Gauss's Arithmetic-Geometric Mean M(2,n^3).at n=39A127764
- Sum of squares of four consecutive primes.at n=12A133524
- Triangle T, read by rows, where column k of T = column 0 of T^(k+1) for k>0, with column 0 of T = column 0 of T^3 shift right.at n=21A135902
- Triangle T, read by rows, where column k of T = column 0 of T^(k+1) for k>0, with column 0 of T = column 0 of T^3 shift right.at n=30A135902
- Column 0 of triangle A135902; also equals column 2 of triangle A135902 (shift right).at n=6A135903
- Number of n X 2 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=37A201347
- G.f.: 1/(1 - x/(1 - x^3/(1 - x^4/(1 - x^7/(1 - x^11/(1 - x^18/(1 -...- x^Lucas(n)/(1 -...)))))))), a continued fraction.at n=24A206742
- Number of inequivalent ways to color a 4 X 4 checkerboard using at most n colors allowing rotations and reflections.at n=2A217338
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 3 6 or 7.at n=13A252257