6714
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
- 12
- Divisor Sum
- 14586
- Proper Divisor Sum (Aliquot Sum)
- 7872
- 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
- 2232
- Möbius Function
- 0
- Radical
- 2238
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 88
- 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 bipartite partitions.at n=12A002764
- Numbers k such that the continued fraction for sqrt(k) has period 60.at n=29A020399
- Expansion of g.f. (1-x^2)/(1-x-2*x^2+x^3).at n=16A028495
- Numbers k for which k-th primorial + square of (k+1)-th prime is also a prime.at n=17A038767
- Numbers k such that k*2^k+(k-1) is prime.at n=11A046849
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) 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) = 2.at n=42A050028
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=42A050044
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 2.at n=42A050060
- Expansion of (1-2*x)*(1-x)/(1-5*x+6*x^2-x^3).at n=8A052975
- Euler transform of reduced totient function psi(n), cf. A002322.at n=19A061257
- Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers.at n=3A067093
- Numbers n such that n and the n-th prime have the same digits.at n=14A074350
- Interprimes which are of the form s*prime, s=18.at n=19A075293
- Bisection of A088567.at n=50A088575
- n times n+1 gives the concatenation of two numbers m and m+2.at n=4A116301
- Numbers k such that the k-th triangular number contains only digits {2,4,5}.at n=4A119159
- 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, 0, 1), (-1, 1, 1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}.at n=9A148212
- Number of ways to place 2 nonattacking kings on an n X n X n raumschach board.at n=5A166540
- Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n = 2*r + p_i and define a(-2)=0. Then, a(n) = a(2*r + p_i) gives the quantity of H_(7,3,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x = sqrt(2*cos(Pi/7)).at n=33A187067
- Square table T(n, d) read by antidiagonals: number of ways to place 2 nonattacking kings on an n^d (n X n X ...) raumschach board (hypercubical chessboard).at n=23A194604