7434
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 11286
- 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
- 2088
- Möbius Function
- 0
- Radical
- 2478
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- Number of equivalence classes of base-3 necklaces of length n, where necklaces are considered equivalent under both rotations and permutations of the symbols.at n=12A002076
- Population of "Triangle" cellular automaton at n-th generation.at n=39A018189
- a(n) = n*(19*n - 1)/2.at n=28A022276
- Expansion of g.f. 1/((1-x)*(1-5*x)*(1-10*x)*(1-11*x)).at n=3A023946
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=47A050037
- Numbers n such that 243*2^n-1 is prime.at n=36A050880
- An approximation to sigma_{5/2}(n): round( sum_{d|n} d^(5/2) ).at n=34A058273
- An approximation to sigma_{5/2}(n): ceiling( sum_{d|n} d^(5/2) ).at n=34A058274
- Number of 2-trees rooted at an edge.at n=7A058866
- Number of 2-trees rooted at a triangle with 3 similar edges.at n=8A063689
- Numbers k such that (k, phi(k), sigma(k)) lies on a sphere with integral radius centered at the origin, i.e., k^2 + phi(k)^2 + sigma(k)^2 is a square.at n=4A066785
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=38A073535
- Triangle read by rows: T(n,k), n >=1, 0 <= k <= C(n,k), = number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere and with k 1's above the diagonal.at n=57A083029
- Number of compositions of n into 4 parts such that no two adjacent parts are equal.at n=33A106353
- The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=48A112358
- Triangle read by rows: T(n,k) = a(k)*binomial(n,k) (0 <= k <= n), where a(0)=1, a(1)=2, a(k) = a(k-1) + 3*a(k-2) for k >= 2 (a(k) = A006138(k)).at n=50A124959
- Number of tieless basketball games from the years 1896-1967 with n scoring events.at n=7A135489
- Number of numbers removed in each step of Eratosthenes's sieve for 10^6.at n=8A145539
- A104449(n+1)+prime(n), sum of a Lucas and the prime sequence.at n=16A160244
- Number of n X 4 binary arrays with each 1 adjacent to exactly two other 1s.at n=9A183325