7276
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
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 6332
- 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
- 3392
- Möbius Function
- 0
- Radical
- 3638
- Omega Function (Ω)
- 4
- 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
- 163
- 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
- a(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.at n=15A004255
- Numbers k such that phi(k) + 10 | sigma(k).at n=11A015801
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=22A020407
- Sort-then-add sequence: a(1) = 316, a(n+1) = a(n) + sort(a(n)).at n=8A033861
- Number of compositions of the integer n with strictly smallest part in the first position.at n=21A079501
- Lower triangular matrix T, read by rows, such that the row sums of T^n form the n-dimensional partitions.at n=98A096651
- Duplicate of A004255.at n=16A101357
- a(n) = n*(n+1)*(n^2 + 21*n + 50)/24.at n=15A101854
- a(n) = 2*a(n-1) - a(n-2) + 2*(prime(n+1)-prime(n)); a(1) = 2, a(2) = 3.at n=42A122263
- A triangle of polynomial coefficients: q(x,n)=-((x - 1)^(2*n + 1)/x^n)*Sum[(2*k + 1)^n*Binomial[k, n]*x^k, {k, 0, Infinity}]; p(x,n)=q(x,n)+x^n*q(1/x,n).at n=11A155915
- A triangle of polynomial coefficients: q(x,n)=-((x - 1)^(2*n + 1)/x^n)*Sum[(2*k + 1)^n*Binomial[k, n]*x^k, {k, 0, Infinity}]; p(x,n)=q(x,n)+x^n*q(1/x,n).at n=13A155915
- Number of nX3 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=18A166781
- Numbers n such that n^8 + 1 and (n + 2)^8 + 1 are both prime.at n=23A217972
- Triangle T(n,k) read by rows: T(n,k) = number of permutations on 123...n with exactly two abc patterns and no aj pattern with j<=k, for n>=0, 0<=k<=n.at n=47A229158
- Numbers n such that the digits of sigma(n) are a permutation of those of sigma*(n), where sigma*(n) is the sum of anti-divisors of n (A066417).at n=37A230541
- Numbers k such that 2*R_k + 7*10^k + 5 is prime, where R_k = 11...11 is the repunit (A002275) of length k.at n=7A259135
- Remainder when sum of squares of the first n primes is divided by n-th square pyramidal number.at n=28A282282
- a(n) = 2*(3*n+1)*(9*n+8).at n=11A304506
- Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=10A305485
- Sum of all the parts in the partitions of n into 6 squarefree parts.at n=34A308903