6403
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6760
- Proper Divisor Sum (Aliquot Sum)
- 357
- 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
- 6048
- Möbius Function
- 1
- Radical
- 6403
- 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) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+2)/m < s for some integer k.at n=34A024842
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=40A027662
- 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 79.at n=18A031577
- Number of inequivalent binary [ n,3 ] codes of dimension <= 3 without zero columns.at n=25A034337
- a(1) = 7; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=44A046257
- n plus a googol is prime.at n=18A049014
- 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=43A050037
- Closed 3-dimensional ball numbers (version 1): a(n)= number of integer points (i,j,k) contained in a closed ball of diameter n, centered at (0,0,0).at n=23A053591
- Open 3-dimensional ball numbers (version 1): a(n) is the number of integer points (i,j,k) contained in an open ball of diameter n, centered at (0,0,0).at n=23A053592
- Sum of distinct orders of degree-n permutations.at n=21A060179
- Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...at n=38A062708
- Index of the first occurrence of prime(n) in A060324.at n=18A078454
- Expansion of Product_{m>=1} 1/(1-x^m)^A000009(m).at n=18A089259
- a(n) = A104908(n) - 10*A104863(n).at n=28A104909
- Euler transform of n!.at n=7A107895
- a(n) is the number of integer lattice points inside the right triangle with legs 3n and 4n (and hypotenuse 5n).at n=32A126587
- Members of A038512 of the form k, k+2, k+6, k+8.at n=9A155511
- (8*7^n+1)/3.at n=4A199484
- Number of 0..n arrays x(0..8) of 9 elements with zero 5th differences.at n=23A200332
- 3^n mod 10000.at n=41A216097