14801
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16002
- Proper Divisor Sum (Aliquot Sum)
- 1201
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13680
- Möbius Function
- 0
- Radical
- 779
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(4th elementary symmetric function of Sum_{j=1..k} 1/j, k = 1,2,...,n).at n=8A025214
- Numbers whose base-11 representation has exactly 5 runs.at n=25A043648
- 23-gonal numbers: a(n) = n(21n-19)/2.at n=38A051875
- Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).at n=40A051937
- McKay-Thompson series of class 38a for Monster.at n=46A058658
- Number of positive integers <= 10^n that are divisible by no prime exceeding 5.at n=20A106598
- Members of A038512 of the form k, k+2, k+6, k+8.at n=12A155511
- a(n) = 400 * n + 1.at n=36A158313
- a(n) = 3*A022004(n) + 8.at n=39A163635
- Numbers k such that (2^k + k + 1)*2^k + 1 is prime.at n=17A201356
- a(n) = 2*n^3 + 3*n^2.at n=19A275709
- a(n) = (2*prime(n)^2 + 1)/3.at n=32A286679
- Number of integer partitions of n whose product of parts is >= n.at n=35A319005
- Consider coefficients U(m,l,k) defined by the identity Sum_{k=1..l} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,l,k) * T^k that holds for all positive integers l,m,T. This sequence gives 2-column table read by rows, where n-th row lists coefficients U(1,n,k) for k = 0, 1 and n >= 1.at n=36A320047
- Main diagonal of A332374.at n=14A332375
- a(n) = one-half of the number of cells in the central rectangle of the graph described in row 2n+1 of A333288.at n=22A337640
- Radicands of pure cubic number fields of type BETA and subtype M0.at n=20A363699
- Partial sums of A224613.at n=43A365446
- Composite numbers that contain only nonprime digits and whose prime factors contain only nonprime digits.at n=30A383934