13046
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
- 21384
- Proper Divisor Sum (Aliquot Sum)
- 8338
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5920
- Möbius Function
- -1
- Radical
- 13046
- 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
- 200
- 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
- Expansion of 1/(1-x^5-x^6-x^7-x^8-x^9-x^10-x^11).at n=44A017842
- Denominators of continued fraction convergents to sqrt(501).at n=10A041957
- Total number of triangles in all polyiamonds with n triangles.at n=10A096361
- Row sums of triangle A101224, which is related to the Flavius sieve (A000960).at n=24A101105
- G.f.: x^2/((1-x^2)^2*Product_{i>0}(1-x^i)).at n=26A103650
- Sums of three consecutive heptagonal numbers.at n=41A129111
- a(1)=1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = a(k) + Sum_{j=1..2^m} a(j).at n=45A139485
- G.f. satisfies: A(x)^(1/2) = x + A(x) + A(A(x)) + A(A(A(x))) + A(A(A(A(x)))) +...at n=8A141201
- 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), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149058
- Number of partitions p of n such that 2*(number of even numbers in p) <= (number of odd numbers in p).at n=41A241652
- Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k HH's. B(n) is the set of lattice paths of weight n that start in (0,0), end on the horizontal axis and never go below this axis, whose steps are of the following four kinds: a (1,0)-step h of weight 1; a (1,0)-step H of weight 2; a (1,1)-step u of weight 2; a (1,-1)-step d of weight 1. The weight of a path is the sum of the weights of its steps.at n=52A246183
- Numbers n>1 such that the difference between log(n) and its best rational approximation as x/y with y<=n produces a new minimum of abs(log(n)-x/y). x/y is provided as A306976/A306977.at n=18A306975
- Number of ways to split an integer partition of n into contiguous subsequences all having different sums.at n=17A336131
- Numbers whose square is of the form k + reversal of digits of k, for some k.at n=46A356648