7764
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 10380
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2584
- Möbius Function
- 0
- Radical
- 3882
- 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
- 101
- Smith Number
- yes
- 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) is the number of partitions of 5n that can be obtained by adding together five (not necessarily distinct) partitions of n.at n=7A002222
- Number of ordered 5-tuples of integers from [ 1,n ] with no common factors among pairs.at n=29A015663
- a(n) = n*(27*n - 1)/2.at n=24A022284
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=28A023862
- a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=31A023867
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=30A024864
- Sum of Manhattan distances over all self-avoiding n-step walks on square lattice. Numerator of mean Manhattan displacement s(n) = a(n)/A046661(n).at n=7A078798
- Indices of primes in sequence defined by A(0) = 83, A(n) = 10*A(n-1) + 63 for n > 0.at n=19A101079
- Least positive number missing from row n of Stern's diatomic array (see A049456 or A002487).at n=20A135510
- a(n) = 216*n - 12.at n=35A154518
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210749; see the Formula section.at n=40A210750
- a(n) = n^5 - 2n.at n=6A242436
- Numbers k such that Bernoulli number B_k has denominator 2730.at n=29A249134
- Non-palindromic balanced numbers in base 16.at n=40A256080
- Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than n elements linked to themselves.at n=4A271609
- Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 5 elements linked to themselves.at n=4A271614
- Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 6 elements linked to themselves.at n=4A271615
- T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=40A271617
- T(n,k) = Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than k elements linked to themselves.at n=49A271617
- Numbers n such that phi(n) is a Fibonacci number.at n=34A280592