14037
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18720
- Proper Divisor Sum (Aliquot Sum)
- 4683
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9356
- Möbius Function
- 1
- Radical
- 14037
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of x.at n=8A056131
- Numbers k that, when expressed in base 5 and then interpreted in base 8, give a multiple of k.at n=34A062930
- a(n) = 484*n + 1.at n=28A158326
- Number of n-bead necklaces labeled with numbers -5..5 not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=5A209112
- T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=50A209115
- Number of 6-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2.at n=4A209118
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^3 < x^3 + y^3.at n=27A211650
- Number of partitions of n into exactly 4 different parts with distinct multiplicities.at n=35A212115
- Number of (n+3) X 9 0..2 matrices with each 4 X 4 subblock idempotent.at n=8A224726
- Number of partitions of n such that the number of parts having multiplicity 1 is a part or the number of distinct parts is a part.at n=36A241446
- a(n) = Sum_{k=0..n} 2^(n-k)*p(k), where p(k) is the partition function A000041.at n=12A259401
- p-INVERT of (n!), n >= 1 (A000142, shifted), where p(S) = 1 - S - S^2.at n=6A289924
- Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=13A298439
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=9A301493
- Positive integers that have exactly nine representations of the form 1 + p1 * (1 + p2* ... * (1 + p_j)...), where [p1, ..., p_j] is a (possibly empty) list of distinct primes.at n=22A317399
- Numbers k such that k, k + 1, k + 2, and k + 4 are all semiprimes.at n=40A368670