14620
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 33264
- Proper Divisor Sum (Aliquot Sum)
- 18644
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 7310
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- Coordination sequence for MgNi2, Position Ni1.at n=30A009933
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14).at n=36A017836
- Numbers which can be expressed as the product of a number and its reversal in at least two different ways.at n=10A066531
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=39A081384
- Let f(x)=(largest digit of x)^(smallest digit of x) + x (A097385). Sequence gives numbers n such that f(n) and f(n+1) are both prime.at n=32A097387
- 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), (0, 1, -1), (1, 0, 1), (1, 1, -1), (1, 1, 1)}.at n=7A150952
- 28-gonal numbers: a(n) = n*(13*n - 12).at n=34A161935
- Number of n X 3 arrays with every diagonal and antidiagonal of length L containing a permutation of 1..L.at n=14A179808
- Monotonic ordering of nonnegative differences 7^i-3^j, for 40>= i>=0, j>=0.at n=22A192154
- Number of (w,x,y,z) with all terms in {1,...,n} and w <= x > y <= z.at n=16A212246
- Number of 6 X n arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 6 X n array.at n=16A220036
- a(n) = practical(2^n) where practical(n) is the n-th practical number (A005153).at n=11A225316
- The total number of squares and rectangles appearing in the Thue-Morse sequence logical matrices after n stages.at n=8A241685
- A246316(2^n-1).at n=7A246317
- Expansion of f(x^3, x^9) * f(x^6, x^6) / f(-x, -x^2) in powers of x where f(,) is Ramanujan's general theta function.at n=30A257655
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 605", based on the 5-celled von Neumann neighborhood.at n=23A273177
- Expansion of x*(1 + 3*x + x^2)/((1 - x)^5*(1 + x)^4).at n=30A287143
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=39A331454
- G.f. A(x) satisfies: x^2 = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)/2) * A(x)^n.at n=11A355356
- Number of edges in a Farey fan of order n.at n=41A360043