13338
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
- 32
- Divisor Sum
- 33600
- Proper Divisor Sum (Aliquot Sum)
- 20262
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 1482
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Number of partitions of n into at most 9 parts.at n=40A008638
- Number of partitions of n into 9 unordered relatively prime parts.at n=40A023029
- Number of partitions of n in which the greatest part is 9.at n=49A026815
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+9 or 24k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=50A036033
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 3,2,0.at n=4A037671
- Engel expansion of sinh(1/3).at n=19A068380
- Numbers k such that the number of steps to reach 1 in '3x+1' problem equals tau(k), the number of divisors of k.at n=19A070980
- Least k such that k*Mersenne-prime(n)*Mersenne-prime(n+1) - 1 is prime.at n=21A098915
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 (i.e., E steps from the line y=x+1 to the line y = x).at n=40A110098
- a(n) = sum of numbers without digit 1 and with product of digits = n-th 7-smooth number.at n=17A130975
- Number of 5-way intersections in the interior of a regular 6n-gon.at n=38A137939
- a(n) = phi(n)*T(n), where phi(n) is Euler's totient function (A000010) and T(n) = n*(n+1)/2 is the n-th triangular number (A000217).at n=37A143268
- 3 times 9-gonal (or nonagonal) numbers: a(n) = 3*n*(7*n-5)/2.at n=36A152759
- Averages of twin prime pairs such that p1 * p2 + AverageTwinPrime is prime.at n=43A154667
- a(n) = 9*n*(n+1).at n=38A163758
- a(n) = n*(2*n^2 + 5*n + 3).at n=18A163815
- a(n) = 19*n*(n+1).at n=26A173309
- a(n) = (7*n+2)*(7*n+5) = 49*n^2 + 49*n + 10.at n=16A177060
- Number of nX4 binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=5A183469
- Number of nX6 binary arrays with every element equal to either the sum mod 2 of its vertical neighbors or the sum mod 2 of its horizontal neighbors.at n=3A183471