7636
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
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 6476
- 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
- 3608
- Möbius Function
- 0
- Radical
- 3818
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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
- Sequence satisfies T^2(a)=a, where T is defined below.at n=44A027593
- "AGK" (ordered, elements, unlabeled) transform of 1,2,3,4...at n=11A032025
- Number of mobiles (circular rooted trees) with n nodes and 3 leaves.at n=22A055341
- Number of solutions to 1 +- 2 +- 3 +- ... +- n = 0.at n=19A058377
- Number of ways of partitioning the integers {1,2,..,4n} into two (unordered) sets such that the sums of parts are equal in both sets (parts in either set will add up to (4n)*(4n+1)/4). Number of solutions to {1 +- 2 +- 3 +- ... +- 4n=0}.at n=5A060005
- Number of ways of partitioning the set {1...n} into two subsets whose sums are as nearly equal as possible.at n=19A069918
- Sum of first n 7-almost primes.at n=13A086059
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n having k (1,1) steps starting at level zero (can be easily expressed also in RNA secondary structure terminology).at n=54A089736
- a(n) = floor(7^n/6^n).at n=58A094988
- Quotients associated with A097982.at n=14A098024
- Iccanobirt numbers (4 of 15): a(n) = R(a(n-1)) + a(n-2) + a(n-3), where R is the digit reversal function A004086.at n=15A102114
- Erroneous version of A058377.at n=9A124624
- Eigentriangle by rows, A143971 * (A108300 * 0^(n-k)); 1<=k<=1.at n=43A143972
- 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), (-1, -1, 0), (-1, 1, 0), (1, 0, 0), (1, 1, 1)}.at n=7A150680
- 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), (-1, -1, 1), (-1, 1, 0), (1, 0, 0), (1, 1, 1)}.at n=7A150681
- The number of homogeneous trisubstituted linear alkanes.at n=22A159938
- G.f.: 1 = Sum_{n>=0} a(n)*exp(-n!*x)*x^n/n!.at n=5A191505
- a(n) = 2*n*(7*n + 5).at n=23A195027
- Number of nX3 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=6A203633
- Number of n X 7 0..1 arrays with the counts of all possible adjacent horizontal and vertical pair sum values being within one of each other.at n=2A203637