7262
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10896
- Proper Divisor Sum (Aliquot Sum)
- 3634
- 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
- 3630
- Möbius Function
- 1
- Radical
- 7262
- Omega Function (Ω)
- 2
- 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
- 101
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=22A010005
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 84.at n=15A031582
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 4).at n=59A046766
- Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=16A078612
- a(n) = Sum_{k=1..2^n} d(k) where d(n) = number of divisors of n (A000005).at n=10A085831
- a(n) = dimension of the space in which the sphere of radius n is of maximum volume.at n=33A121546
- 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, 0, 1), (0, 1, -1), (0, 1, 1), (1, 0, -1)}.at n=7A150673
- 529n^2 - 312n + 46.at n=4A156841
- a(n) = Sum_{k=1..n^2} d(k), d(k) = number of divisors of k (A000005).at n=31A175346
- a(n) = 2^(prime(n)-1) mod prime(n)^2.at n=32A196202
- Triangle read by rows, arising in enumeration of permutations by cyclic peaks, cycles and fixed points.at n=19A216963
- Triangle read by rows, related to Bell numbers A000110: A216963 interlaced with A217202.at n=32A217205
- Number of 0..2 arrays of length n with each element differing from at least one neighbor by 1 or less, starting with 0.at n=9A221677
- T(n,k)=Number of 0..k arrays of length n with each element differing from at least one neighbor by 1 or less, starting with 0.at n=64A221683
- Numbers n such that the decimal expansions of both n and n^2 have 2 as smallest digit and 7 as largest digit.at n=8A257123
- Compound filter: a(n) = P(A055881(n), A278236(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=43A286381
- Compound filter: a(n) = P(A257993(n), A278226(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=49A286382
- Compound filter (2-adic valuation & sum of the divisors): a(n) = P(A001511(n), A000203(n)), where P(n,k) is sequence A000027 used as a pairing function.at n=53A286460
- a(n) = s(n) - prime(n+1)+3, where s(n) = smallest even number x > prime(n) such that the difference x-p is composite for all primes p <= prime(n).at n=37A298736
- a(n) = 2*n^3 - 4*n^2 + 6*n - 2 (n>=1).at n=15A304159