13135
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16416
- Proper Divisor Sum (Aliquot Sum)
- 3281
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- -1
- Radical
- 13135
- Omega Function (Ω)
- 3
- 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
- 76
- 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
- no
- Odd
- yes
Appears in sequences
- a(n+1) = a(n) converted to base 10 from base 11.at n=52A055982
- Number of polypons with n cells.at n=16A057784
- Terms k of A002977 such that both (k-1)/2 and (k-1)/3 are also terms of A002977.at n=8A085249
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=41A105720
- Odd winning positions in Fibonacci nim.at n=29A120904
- Number of Garden of Eden partitions of n in Bulgarian Solitaire.at n=38A123975
- Number of nonisomorphic partial functional graphs with n points which are not functional graphs.at n=10A127911
- Floor of sum of the first n^2 square roots.at n=27A138357
- 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, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1), (1, 1, 0)}.at n=7A150844
- a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/sin(n) > a(k)/sin(a(k)), so that a(1)/sin(a(1)) > a(2)/sin(a(2)) > ... > a(k)/sin(a(k)) > ...at n=32A172445
- a(n) = 12*n^2 + 2*n + 1.at n=33A194454
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209171; see the Formula section.at n=47A209170
- Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 2 ("abcdefg" scheme: bits represent segments in clockwise order).at n=43A234692
- Expansion of (1-3*x)^3/((1-x)^4*(1-4*x)).at n=9A262593
- a(n) = 2*A090495(n) - 1.at n=25A274297
- Expansion of exp( Sum_{n>=1} -sigma_5(n)*x^n/n ) in powers of x.at n=7A283271
- The number of partitions of n which represent Chomp positions with Sprague-Grundy value 5.at n=53A284692
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 734", based on the 5-celled von Neumann neighborhood.at n=29A290212
- a(n) is the least integer k such that k/Fibonacci(n) > Pi.at n=19A293678
- a(n) is the integer k that minimizes |k/Fibonacci(n) - Pi|.at n=19A293679