14390
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 11530
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5752
- Möbius Function
- -1
- Radical
- 14390
- 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
- 120
- 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
- Multiplicity of highest weight (or singular) vectors associated with character chi_5 of Monster module.at n=48A034393
- Successive maxima in sequence A007365.at n=7A065933
- Numbers k such that phi(k) + phi(k+1) = k+2.at n=20A067797
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=31A095234
- Total number of all repeated partitions of the integer n and its parts down to parts equal to 1. Essentially first differences of A055887.at n=10A143141
- 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), (-1, 1, -1), (1, 0, 0), (1, 1, -1)}.at n=10A148228
- 144*n^2 - n.at n=9A156635
- a(n) = 576*n^2 - 2*n.at n=4A158371
- a(n) = 100*n^2 - 10.at n=11A158490
- Number of 3 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=34A229446
- Number of length n binary words which contain 00 and 01 and 10 and 11 as (possibly overlapping) contiguous subsequences.at n=9A242206
- Number T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape N; triangle T(n,k), n>=0, read by rows.at n=19A247705
- Numbers k such that (28*10^k - 13) / 3 is prime.at n=24A262937
- Numbers m such that each of p=6*m+1, q=6*p+1, r=6*q+1 and s=6*r+1 is prime.at n=18A263311
- Number of length-4 0..n arrays with no repeated value differing from the previous repeated value by one or less.at n=9A269607
- Ascending list of base-60 happy numbers written in base 10.at n=37A318235
- a(n) is the sum over all partitions of n of the number of right angles that are not the largest right angle.at n=30A330378
- Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) = number of interior vertices where exactly three lines cross.at n=30A336489
- The number of layers of vertices that ever have chips in a certain chip-firing game that starts with 2^n chips and is described in the comments.at n=20A390129