13055
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17952
- Proper Divisor Sum (Aliquot Sum)
- 4897
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8928
- Möbius Function
- -1
- Radical
- 13055
- 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
- 107
- 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) = 2*a(n-1) - a(n-2) + a(n-3) + 2^(n-1).at n=12A000253
- Numbers k such that k^2 and k^3 have the same set of digits.at n=20A029797
- Nonprimes m such that phi(m)*sigma(m) is divisible by m+1.at n=43A065148
- Composite k such that (k+1) * Sum_{d|k} d/sigma(d) is an integer.at n=11A068975
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=34A110735
- A sequence of asymptotic density zeta(9) - 1, where zeta is the Riemann zeta function.at n=25A143035
- 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, 0), (-1, 1, -1), (0, 1, -1), (0, 1, 1), (1, 0, 0)}.at n=8A150007
- The z^2 coefficients of the polynomials in the GF3 denominators of A156927 divided by 2.at n=4A157707
- Numbers n with property that 42*n+37 is in A175284.at n=13A175285
- Number of (n+2) X 6 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically or nw-to-se diagonally exactly three ways, and new values 0..1 introduced in row major order.at n=15A204377
- Number of (n+2) X (2+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=7A260288
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001001.at n=37A260294
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=37A294871
- Triangle T(n,k) of number of chains of length k in partitions of an n-set ordered by refinement.at n=25A331955
- Admirable totient numbers: numbers that are equal to the sum of their iterated phi, with one of them taken with a minus sign.at n=40A335121
- Sum over all partitions of n of the GCD of the number of parts and the number of distinct parts.at n=31A339312
- Number of odd-length integer partitions of n with a unique mode.at n=39A363726
- Number of strict integer partitions of 2n not containing n.at n=31A365828