13437
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 19422
- Proper Divisor Sum (Aliquot Sum)
- 5985
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8952
- Möbius Function
- 0
- Radical
- 4479
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 138
- 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
- Number of consecutive runs of just 1 odd nonprime congruent to 1 mod 4 below 10^n.at n=4A093183
- Eigensequence of triangle A168313.at n=12A168314
- Number of nondecreasing arrangements of 5 numbers x(i) in -(n+3)..(n+3) with the sum of sign(x(i))*x(i)^2 zero.at n=41A188005
- Irregular array read by rows: T(n,k) = number of r_{n,k}-cores associated with A233332(n,k), for n>=2, 1<=k<=floor(n/2), explained below.at n=40A233330
- Number of connected n-regular loopless multigraphs on six unlabeled nodes.at n=13A324218
- Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k.at n=22A325376
- Number of sets of primes less than the n-th prime whose sum is the n-th prime.at n=52A334292
- Numbers k for which the 3-adic valuations of k and sigma(k) are equal, and that also satisfy Euler's criterion for odd perfect numbers (see A228058).at n=49A349755
- Odd composites k such that sigma(k) has the same powerful part as k, where sigma is the sum of divisors function.at n=13A386425
- Numbers k satisfying Euler's criterion for odd perfect numbers (A228058), such that sigma(k)+k is also a multiple of 3, and sigma(k) preserves the 3-adic valuation of k, where sigma is the sum of divisors function.at n=49A387162