14413
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 2867
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11760
- Möbius Function
- -1
- Radical
- 14413
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 164
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n*(3^n - 2^n).at n=7A004142
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.at n=37A049714
- Number of orbits of the 5-step recursion mod n.at n=48A106287
- a(1) = 11, a(n) = least k such that concatenation of n copies of k with all previous concatenation gives a prime.at n=48A111477
- 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), (-1, 1, 0), (0, 0, -1), (1, 0, 1), (1, 1, 1)}.at n=7A150949
- 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, 1, -1), (0, 1, 1), (1, 0, 0), (1, 1, 0)}.at n=7A151080
- 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=29A152777
- Numbers k such that 12321*2^k + 1 is prime.at n=26A180924
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+287)^2 = y^2.at n=23A205644
- a(n) is the smallest number that is the sum of both 2n-1 and 2n+1 consecutive primes.at n=24A213174
- Number of length-(n+1) 0..2 arrays with new repeated values introduced in sequential order starting with zero.at n=8A268255
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 121", based on the 5-celled von Neumann neighborhood.at n=6A270207
- Positions of squares in A276573.at n=40A277014
- a(n) = n*(2*n - 3 - (-1)^n)*(5*n - 2 + (-1)^n)/16.at n=28A308025
- Sum of the fourth largest parts of the partitions of n into 9 parts.at n=40A326470
- Starhex honeycomb numbers: a(n) = 13 + 60*n + 60*n^2.at n=15A332243