13630
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 12290
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5152
- Möbius Function
- 1
- Radical
- 13630
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Cubes written in base 9.at n=20A004639
- Expansion of 1/((1-7x)(1-8x)(1-9x)(1-11x)).at n=3A028220
- Trajectory of 3 under map n->33n+1 if n odd, n->n/2 if n even.at n=6A037114
- Numbers such that the sum of the factorials of the digits of the fourth power is a square.at n=20A126077
- Numbers m such that product of factorials of digits of m equals sigma(m).at n=6A137603
- 0-sequence of reduction of (3n-1) by x^2 -> x+1.at n=13A192309
- G.f. satisfies: A(x) = Product_{n>=0} 1/( (1 - (x*A(x))^(5*n+2)) * (1 - (x*A(x))^(5*n+3)) ).at n=13A203068
- Sum of the cubes of the first n even-indexed Fibonacci numbers divided by the sum of the first n terms.at n=5A219020
- Number of compositions of n in which the minimal multiplicity of parts equals 5.at n=19A244168
- Number of permutations p of [n] whose absolute displacements |p(i)-i| are factorial numbers.at n=13A324376
- a(n) = Sum_{i=1..n, j=1..n, gcd(i,j)=1} i.at n=34A333297
- Numbers with arithmetic derivative which is a palindromic prime number (A002385).at n=24A359332
- a(n) = Sum_{1 <= x_1, x_2 <= n} sigma( n/gcd(x_1, x_2, n) ).at n=19A373129
- Start with two vertices and draw a circle around each whose radius is the distance between the vertices. The sequence gives the number of curved edges constructed after n iterations of drawing circles with this same radius around every new vertex created from all circles' intersections.at n=47A374339