6429
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8576
- Proper Divisor Sum (Aliquot Sum)
- 2147
- 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
- 4284
- Möbius Function
- 1
- Radical
- 6429
- 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
- 168
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.at n=24A001214
- a(n) = n^4 + (9/2)*n^3 + n^2 - (9/2)*n + 1.at n=8A003878
- Numbers k such that the continued fraction for sqrt(k) has period 86.at n=12A020425
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence).at n=29A025118
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 3. Also a(n) = T(n,n-3), where T is the array defined in A024996.at n=8A026070
- 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 52.at n=36A031550
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 38 ones.at n=30A031806
- Number of quaternary codes of length 7 with n words.at n=4A034238
- Number of quaternary codes (not necessarily linear) of length n with 4 words.at n=6A034241
- Denominators of continued fraction convergents to sqrt(749).at n=10A042443
- Triangle T(n,m) of number of labeled n-node T_0-hypergraphs with m distinct hyperedges (empty hyperedge excluded), m=0,1,...,2^n-1.at n=22A059087
- Integer part of (Product(n^((1 + log(1 + i))/(1 + i^2)), {i, 1, n})).at n=44A062492
- Nearest integer to (Product(n^((1 + log(1 + i))/(1 + i^2)), {i, 1, n})).at n=44A062493
- Sum of products of factorials of parts in all partitions of n.at n=7A077365
- a(n) = 2^(n-1)*u(n) where u(1)=1 and u(n) = frac(3/2*u(n-1)) + 1.at n=12A079450
- Conjectured numbers n such that the trajectory of n as defined in A003508 is unique.at n=28A105233
- Number of nonempty subsets of {1,2,...,n} with no gap of length greater than 4 (a set S has a gap of length d if a and b are in S but no x with a < x < b is in S, where b-a=d).at n=12A119407
- Numbers k for which 14*k+1, 14*k+5, 14*k+11 and 14*k+13 are primes.at n=24A123987
- Numbers ending in 1, 3, 7 or 9 such that either prepending or following them by one digit doesn't produce a prime.at n=33A124666
- A linear combination of Eulerian numbers (A008292) and Pascal's triangle (A007318); t(n,m)=(3*A008292(n,m)-A007318(n,m))/2.at n=30A141691