16050
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 40176
- Proper Divisor Sum (Aliquot Sum)
- 24126
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4240
- Möbius Function
- 0
- Radical
- 3210
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 45
- 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
- Coefficients of polynomials (n-1)!*P(n,k), P(n,k) = Sum_{i=0..n} Stirling2(n,i)*binomial(k+i-1,k).at n=18A059604
- When expressed in base 3 and then interpreted in base 7, is a multiple of the original number.at n=32A062884
- Let a(1)=0. Then a(i+1)=position of first occurrence of a(i) in decimal expansion of log 2.at n=15A098289
- a(0) = a(1) = 1; for n >= 2, a(n) = a(n-1) + a(n-2) - n if that number is positive and not already in the sequence, otherwise a(n) = a(n-1) + a(n-2) + n.at n=22A117821
- a(n) = 5*p^5 + 3*p^3 + 2*p^2, where p = prime(n).at n=2A133064
- 5*n^5 + 3*n^3 + 2*n^2. Coefficients and exponents are the prime numbers in decreasing order.at n=5A134633
- Total walk count of molecular graphs for linear alkanes with n carbon atoms.at n=11A144952
- Number of binary strings of length n with no substrings equal to 0001 0010 or 1100.at n=14A164451
- Number of arrays of the median of three adjacent elements of some length n+2 0..1 array.at n=15A228733
- Square array A(1,k) = A265907(k), A(n>1,k) = A(n-1, k+1) - A(n-1, k); successive differences of A265907 read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...at n=20A275960
- Transpose of array A275960.at n=15A275961
- Leftmost column of array A275960.at n=5A275965
- a(n) = Sum_{k=1..n} k * A088370(n,k).at n=39A309371
- a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence.at n=39A331503
- Array listed by antidiagonals: row m is the numbers k such that prime(i)+k is prime for i from m to j where prime(j+1) = A360228(m).at n=18A359843
- Number of vertices among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle when every pair of the 3 + 3*n points are connected by a circle and where the points lie at the ends of the circle's diameter.at n=6A372731
- a(n) = Sum_{i+j+k+l+m+r=n, i,j,k,l,m,r >= 1} sigma(i)*sigma(j)*sigma(k)*sigma(l)*sigma(m)*sigma(r).at n=10A374979
- Intersection of A391845 and A391866.at n=49A392592