8275
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 10292
- Proper Divisor Sum (Aliquot Sum)
- 2017
- 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
- 6600
- Möbius Function
- 0
- Radical
- 1655
- 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
- 96
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k! - (k-1)! + (k-2)! - (k-3)! + ... - (-1)^k*1! is prime.at n=20A001272
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=18A070192
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=33A079094
- a(n) = 3^(n-1)*(2*n-3) + 2^(n+1).at n=7A084643
- Sum of first 2n primes.at n=31A109722
- Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=34A117455
- 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, 0, 1), (-1, 1, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1)}.at n=8A149011
- a(n) = 4*n^2 + 12*n + 3.at n=43A153169
- Number of planar n X n X n binary triangular grids with mirror symmetry about one altitude with no more than 6 ones in any 5 X 5 X 5 subtriangle.at n=7A153951
- Numbers k such that 1 + Sum_{j=0..k} (-1)^j*(k-j)! is prime.at n=15A157833
- Number of binary strings of length n with no substrings equal to 0000 or 0110.at n=15A164390
- Numbers of the form 12n+7 for which Sum_{i=0..(4n+2)} J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol.at n=24A165463
- Partial sums of A000048.at n=17A173278
- Number of (n+2) X (4+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=7A252807
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 8 as largest digit.at n=23A257368
- Numbers n for which the numbers 6n+1, 3n+2, 6n+7 are all odd composite squarefree numbers, but none are semiprimes.at n=6A263510
- Number of dying nodes (withering branches) at generation n in the binary tree of persistently squarefree numbers (A293230).at n=37A293520
- Triangle read by rows, T(n, k) = binomial(n, k)*hypergeom([k-n, n+1], [k+2], -4), for n >= 0 and 0 <= k <= n.at n=32A297899
- Arithmetic derivative of the primorial base exp-function: a(n) = A003415(A276086(n)).at n=51A327860
- Total number of vertices in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces, counting coinciding intersection points only once.at n=53A331782