15133
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
- 4
- Divisor Sum
- 15580
- Proper Divisor Sum (Aliquot Sum)
- 447
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14688
- Möbius Function
- 1
- Radical
- 15133
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=32A026043
- Number of catafusenes with C_{2v}(b) symmetry (see reference for precise definition).at n=8A045908
- Triangle T, read by rows, such that T(n,k) equals the (n-k)-th row sum of T^k, where T^k is the k-th power of T as a lower triangular matrix.at n=47A091351
- Row sums of the matrix square of triangle A091351, in which the k-th column lists the row sums of A091351^k (the k-th power of A091351 when considered as a lower triangular matrix).at n=7A091353
- Triangle, read by rows, such that T(n,k) equals the k-th term of the convolution of the (n-1)-th diagonal with the k-th row of this triangle.at n=52A098446
- Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT_UP(T) = T^2 - T + I, or, equivalently: T(n+1,k+1) = [T^2](n,k) - T(n,k) + [T^0](n,k) for n>=k>=0, with T(0,0)=1.at n=57A104445
- Numbers k such that the k-th triangular number contains only digits {1,4,5}.at n=10A119124
- Number of binary strings of length n with no substrings equal to 0000 0101 or 0110.at n=14A164432
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.at n=8A196431
- T(n,k) = Number of n X k 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,1,0,3,4 for x=0,1,2,3,4.at n=57A196436
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,1,3,2,0 for x=0,1,2,3,4.at n=57A197199
- Numbers n where tau(n) and n-tau(n) are perfect squares, with tau(n) the number of divisors of n (A000005).at n=31A245197
- Least integer k such that k/2^n > e^2.at n=11A293360
- The integer k that minimizes |k/2^n - e^2|.at n=11A293361
- a(n) is the number of integer partitions of n for which the Kimberling index is equal to the index of the seaweed algebra formed by the integer partition paired with its weight.at n=55A318177
- Semiprimes of the form k^2 + 4.at n=26A360741
- a(n) = Lucas(n) + 6.at n=19A386707
- Number of solid partitions of n with 4 parts.at n=37A387997