13653
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
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 20748
- Proper Divisor Sum (Aliquot Sum)
- 7095
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- 0
- Radical
- 4551
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 19
- 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
- Poincaré (or Molien) series for ring of Siegel modular forms of genus 3 (associated with full modular group Gamma_3).at n=48A027634
- Numbers whose base-2 representation has exactly 13 runs.at n=13A043580
- a(n) = a(n-1) + 2*a(n-2), a(0)=2, a(1)=3.at n=13A048573
- a(n+1) = smallest number not containing any digits of a(n), working in base 4.at n=17A049548
- Multiples of 3 which on one operation of the Collatz function T (N -> 3N+1/2^r) yield the number 5.at n=2A072196
- a(n) = 4*a(n-1) + 1 with a(0) = 3.at n=6A072197
- Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 41,35,29,23,17,11, and 5 for r=1,3,5,..,13.at n=6A072252
- Numbers n such that C(4n,n)/(3n+1) (A002293) is not divisible by 4.at n=35A078971
- a(n) = n + floor(Sum_{k<n} a(k)/2) with a(0)=0.at n=22A079719
- Numbers k such that A081252(m)/m^2 has a local maximum for m = k.at n=13A081254
- a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.at n=13A086893
- Floor of area of triangle with consecutive prime sides.at n=39A096377
- a(n) = 4*a(n-2) + 1 with a(1) = 0, a(2) = 3.at n=13A096773
- Array read by antidiagonals. Rows contain odd numbers reaching same odd successor in Collatz function iteration.at n=29A099730
- Divisors of 10^15 - 1.at n=31A111117
- Triangle of sums of Jacobsthal numbers related to binomial(4n,n)/(3n+1) mod 4.at n=27A113049
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, -1, -1), (1, 0, 0), (1, 1, -1)}.at n=10A148149
- a(n) = 729*n - 198.at n=18A156772
- A generalized Jacobsthal sequence.at n=12A159290
- Locations of row maxima in "crushed" version of Stern's diatomic array.at n=25A169969