7264
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14364
- Proper Divisor Sum (Aliquot Sum)
- 7100
- 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
- 3616
- Möbius Function
- 0
- Radical
- 454
- Omega Function (Ω)
- 6
- 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
- 18
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 72.at n=26A020411
- 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 41.at n=36A031539
- Every run of digits of n in base 15 has length 2.at n=31A033013
- Positive integers with more base-15 runs of even length than odd.at n=33A044841
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=24A060879
- Expansion of (1-x)/(1-2*x-2*x^2-2*x^3).at n=9A077843
- Duplicate of A077843.at n=9A077994
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=2, I={0,1}.at n=31A080013
- Expansion of 1/(sqrt(1-4x)sqrt(1-12x)).at n=4A098411
- Number of partitions of n into parts but with two kinds of parts of sizes 1,2,3,4,5 and 6.at n=17A103925
- a(n) = 2 * A285917(n) for n >=2, a(0) = a(1) = 0.at n=12A120672
- Number of nX3 array permutations with each element moved but moved no more than a city block distance of two.at n=2A188977
- T(n,k)=Number of nXk array permutations with each element moved but moved no more than a city block distance of two.at n=12A188981
- Monotonic ordering of nonnegative differences 6^i-2^j, for 40>=i>=0, j>=0.at n=31A192117
- G.f. satisfies: A(x) = exp( Sum_{n>=1} A(x)^n / A(x^n) * x^n/n ).at n=12A198520
- Triangle of coefficients of polynomials u(n,x) jointly generated with A208932; see the Formula section.at n=40A208931
- a(n) is the number of digits in the decimal representation of the smallest power of n that contains nine consecutive identical digits.at n=16A217184
- Number of compositions of n into distinct parts with exactly two descents.at n=21A241721
- Numbers n such that the smallest prime divisor of n^2+1 is 89.at n=27A248551
- Expansion of Product_{k>=1} (1 + x^(3*k-2))^(3*k-2).at n=31A262949