15088
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 31248
- Proper Divisor Sum (Aliquot Sum)
- 16160
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7040
- Möbius Function
- 0
- Radical
- 1886
- Omega Function (Ω)
- 6
- 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
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- Convolution of natural numbers >= 2 and (F(2), F(3), F(4), ...).at n=15A023550
- a(n+3) = 2a(n+2) - 3a(n+1) + 2a(n); a(0) = 1, a(1) = 3, a(2) = 4.at n=34A105579
- Bond series for second parallel moment of 4.8 (bathroom tile) lattice.at n=16A120555
- Triangle, read by rows, where T(n,k) = n*T(n-1,k-1) + T(n-1,k-2) for n>0 and k>1, with T(n,0) = T(n-1,n-1) and T(n,1) = n*T(n-1,0) for n>0 and T(0,0) = 1.at n=37A132005
- a(n) = (n-1)*(n+4)*(n+6)/6 for n > 1, a(1)=1.at n=41A137742
- 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, 1, 1), (1, -1, 1), (1, 1, 0), (1, 1, 1)}.at n=7A150936
- 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, 0, 0), (0, -1, 0), (1, 1, 0), (1, 1, 1)}.at n=7A151020
- Monotonic ordering of nonnegative differences 2^i-6^j, for 40>=i>=0, j>=0.at n=44A192116
- Monotonic ordering of nonnegative differences 4^i-6^j, for 40>= i>=0, j>=0.at n=21A192163
- Period of the n-th convergent to the continued fraction expansion of Pi.at n=6A236250
- Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.at n=2A264421
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.at n=30A264422
- Number of (3+1) X (n+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 2,2 1,0 -1,2 -2,-1 or -1,-1.at n=5A264424
- a(n) = (n-4)*(n+1)*(n+3)/6.at n=41A275874
- Number of sets of exactly n positive integers <= n+5 having a square element sum.at n=37A281968
- Numbers of the form ab such that uphi(ab) = a*b where ab is the concatenation of a and b.at n=23A337523
- a(n) = Sum_{k=0..n} k^n * k! * binomial(n,k)^2.at n=4A341185
- Number of even-length integer partitions of n with integer alternating product.at n=49A347704