6474
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
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 7638
- 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
- 1968
- Möbius Function
- 1
- Radical
- 6474
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = (7*n+1)*(7*n+6).at n=11A001526
- Percolation series for f.c.c. lattice.at n=4A006812
- Expansion of log(1+x)*cosh(log(1+x)).at n=7A009411
- Form array starting with {1,1}; then i-th term in a row gives number of i's in next row; sequence is formed from final term in each row.at n=8A014644
- Number of 3-unbalanced strings of length n (= 2^n - A027557(n)).at n=13A027558
- Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)).at n=49A036818
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=21A037167
- Least k such that k*7^n +/- 1 are twin primes.at n=39A064217
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=14A076425
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=29A094658
- Number of triples (i,j,k) with 1 <= i <= j < k <= n and gcd{i,j,k} = 1.at n=35A100448
- Record gaps between twin primes.at n=35A113274
- Numbers that are not the sum of two triangular numbers and a fourth power.at n=37A115160
- a(n) = Sum {j=1..n} j*A001462(j).at n=37A143125
- Multiples of 13 whose reversal - 1 is also a multiple of 13.at n=40A166397
- Numbers k such that A(k+1) = A(k) + 1, where A() = A005101() are the abundant numbers.at n=6A169822
- Partial sums of A000105.at n=10A173271
- Number of strings of numbers x(i=1..7) in 0..n with sum i*x(i)^3 equal to 7*n^3.at n=13A184724
- a(n) = 6*(24*n - 1).at n=44A187206
- Riordan matrix (1/((1-x)*sqrt(1-4*x)),x/(1-x)).at n=37A187887