7275
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 12152
- Proper Divisor Sum (Aliquot Sum)
- 4877
- 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
- 3840
- Möbius Function
- 0
- Radical
- 1455
- 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
- 132
- 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 219*2^k+1 is prime.at n=32A032486
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 43 for n > 0.at n=7A056257
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.at n=17A058842
- Number of fixed polyominoes with n cells of which no four are equally spaced on a straight line.at n=11A065068
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.at n=43A084142
- Integer part of the area of consecutive prime sided isosceles triangles.at n=30A097442
- Number of base 25 n-digit numbers with adjacent digits differing by three or less.at n=4A126493
- Number of non-isomorphic (i.e., defined up to a rotation and a reflection) maximal independent sets of the n-cycle graph having 2n isomorphic representatives.at n=47A127683
- Numbers n such that n^k+(n+1)^k is prime for k = 1, 2, 4.at n=42A128780
- G.f.: A(x) = (A_1)^3 where A_1 = 1 + x*(A_2)^3; A_2 = 1 + x^2*(A_3)^3; A_3 = 1 + x^3*(A_4)^3; ... A_n = 1 + x^n*(A_{n+1})^3 for n>=1.at n=15A132331
- Numbers k such that k and k^2 use only the digits 2, 5, 6, 7 and 9.at n=16A137112
- 3 times 10-gonal (or decagonal) numbers: a(n) = 3*n*(4*n-3).at n=25A152767
- G.f.: A(x) = exp( Sum_{n>=1} 3*A038500(n) * x^n/n ), where A038500 is the highest power of 3 dividing n.at n=27A161809
- G.f. satisfies: A(x) = Sum_{n>=0} x^n*A(x)^(2*n^2).at n=6A191800
- Smallest possible largest element in a 5 by n average array where repetitions are allowed without diagonals.at n=7A195748
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=30A225385
- Number of ordered triples (i,j,k) with |i|,|j|,|k|,|i*j*k| <= n and gcd(i,j,k) <= 1.at n=27A226357
- Integer areas of the first Neuberg triangles of integer-sided triangles.at n=3A230758
- Number of (n+1) X (1+1) 0..1 arrays with no 2 X 2 subblock having the minimum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=5A251221
- Number of (n+1) X (6+1) 0..1 arrays with no 2 X 2 subblock having the minimum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=0A251226