6407
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6600
- Proper Divisor Sum (Aliquot Sum)
- 193
- 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
- 6216
- Möbius Function
- 1
- Radical
- 6407
- 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
- Composite and every divisor (except 1) contains the digit 4.at n=1A062670
- Sum of composite numbers less than n-th prime.at n=30A079725
- Boustrophedon transform of the continued fraction of Pi (cf. A001203).at n=6A080406
- a(1)=1, then a(n)=2*a(n-1) if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.at n=41A080735
- a(1)=1, a(n)=2a(n-1)+1 if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.at n=30A083005
- Numbers expressible in more than one way as 6^x-y^2.at n=12A134989
- Coefficients of a Ramanujan q-series.at n=26A143184
- 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), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A148990
- Members of A038512 of the form k, k+2, k+6, k+8.at n=10A155511
- Number of nondecreasing arrangements of n+2 numbers in 0..6 with the last equal to 6 and each after the second equal to the sum of one or two of the preceding three.at n=40A190038
- Expansion of 1/((1-x)^2*(1-x^2)^3*(1-x^3)^2*(1-x^4)).at n=18A210068
- G.f. for Ehrhart quasi-polynomials for hyperplane arrangements of type E_7.at n=36A210633
- a(n) = n*(7*n-3)/2.at n=43A218471
- Total sum of 4th powers of parts in all partitions of n.at n=7A229326
- Total sum of n-th powers of parts in all partitions of 7.at n=4A229358
- Smallest k<3*2^n such that 3*2^n+k is the smallest of four consecutive primes in arithmetic progression or 0 if no solution.at n=14A230852
- Numbers n such that n + prime(n), n + 1 + prime(n+1) and n + 2 + prime(n+2) are divisible by 7.at n=41A239457
- Number of partitions p of n such that median(p) > mean(p).at n=42A240220
- Numbers n such that n!3 - 3^5 is prime.at n=26A247465
- Number of pairs (p,q) of partitions of n into distinct parts such that p majorizes q in the dominance order.at n=24A265506