13483
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13720
- Proper Divisor Sum (Aliquot Sum)
- 237
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13248
- Möbius Function
- 1
- Radical
- 13483
- 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
- 45
- 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
- Pseudoprimes to base 96.at n=41A020224
- Convolution of A000201 with itself.at n=30A023663
- c(i,j) is cost of evaluation of edit distance of two strings with lengths i and j, when you use recursion (every call has a unit cost, other computations are free); sequence gives c(n,n).at n=6A027618
- a(n) = n^2 + 731*n + 1.at n=18A180919
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209170; see the Formula section.at n=51A209171
- Satisfies Sum_{n>=0} a(n)*x^n = x / Product_{n>=0} (1 - x^n/(1 - x^n))^a(n).at n=11A248870
- Poincaré series for invariant polynomial functions on the space of binary forms of degree 9.at n=23A293934
- Sum of the second largest parts in the partitions of n into 6 parts.at n=38A308872
- Number of integer partitions of n whose maximum multiplicity is one greater than their minimum multiplicity.at n=47A325279
- Numbers k such that phi(k) > phi(k+1) > phi(k+2) > phi(k+3) where phi is the Euler totient function (A000010).at n=19A326817
- Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by all parts.at n=43A330952
- a(0) = ... = a(3) = 1; a(n) = Sum_{k=1..n-4} a(k) * a(n-k-4).at n=29A346048