6314
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 5782
- 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
- 2400
- Möbius Function
- 1
- Radical
- 6314
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 31
- 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
- Dodecahedral surface numbers: a(0)=0, a(1)=1, a(2)=20, thereafter 2*((3*n-7)^2 + 21).at n=21A007589
- 5-wave sequence.at n=30A038201
- G.f.: 1/(1 - 3 x - 3 x^2 + 4 x^3 + x^4 - x^5).at n=7A038342
- Numbers whose base-5 representation contains exactly two 0's and three 2's.at n=20A045183
- a(n) = T(2n-1,n), array T given by A048225.at n=42A048234
- Starting from generation 6 add previous and next term yielding generation 7.at n=25A048453
- Number of nonaveraging subsets on {1,2,...,n}.at n=17A051013
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.at n=34A070899
- Harshad numbers which terminate in their digital sum.at n=36A070938
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=13A075154
- Largest possible z-value of an integer solution (x,y,z) to 4/n = 1/x + 1/y + 1/z satisfying 0 < x < y < z. The x and y components are in A075245 and A075246.at n=38A075247
- a(n) = (5*n+2)*(5*n+7).at n=15A085036
- Positions of records in A069862.at n=15A088947
- 4-almost primes equal to the product of two successive semiprimes.at n=25A108215
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x).at n=31A110098
- Multiples of 14 containing a 14 in their decimal representation.at n=21A121034
- Expansion of 1/(1-x-x^2+x^3-x^4).at n=22A124280
- a(n) = core(A143176(n)).at n=40A144362
- 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, 0), (-1, 0, 1), (0, 1, -1), (0, 1, 0), (1, 0, 1)}.at n=7A150278
- Numbers m such that (6*m)^5 is a sum of a twin prime pair.at n=32A173560