16137
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25584
- Proper Divisor Sum (Aliquot Sum)
- 9447
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9720
- Möbius Function
- 0
- Radical
- 5379
- Omega Function (Ω)
- 4
- 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
- 190
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of series-reduced planted trees with n+9 nodes and 4 internal nodes.at n=32A001860
- Number of 4-line partitions of n decreasing across rows.at n=24A003292
- Numbers which are the sum of two positive cubes and divisible by 11.at n=24A101852
- Difference between n-th prime squared and n-th perfect square.at n=31A106588
- Maximal value of sum(p(i)p(i+1),i=1..n), where p(n+1)=p(1), as p ranges over all permutations of {1,2,...,n}.at n=35A110610
- Partial sums of A005109.at n=23A172167
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 6,0,3,0,1,1,1 for x=0,1,2,3,4,5,6.at n=5A207159
- Number of nX3 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX3 array.at n=4A219823
- T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array.at n=25A219828
- Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 5Xn array.at n=2A219832
- Numbers of the form 5^j + 8^k, for j and k >= 0.at n=33A226823
- Somos's sequence {b(7,n)} defined in comment in A078495: a(0)=a(1)=...=a(16)=1; for n>=17, a(n)=(a(n-1)*a(n-16)+a(n-8)*a(n-9))/a(n-17).at n=40A271954
- Sum over all partitions of n of the number of distinct parts i of multiplicity i - 1.at n=40A277101
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 533", based on the 5-celled von Neumann neighborhood.at n=13A282957
- Number of Dyck paths of semilength n such that the maximal number of peaks per level equals five.at n=7A288746
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n-1), where a(0) = 1, a(1) = 4, b(0) = 2, b(1) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=14A296290