16538
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 24810
- Proper Divisor Sum (Aliquot Sum)
- 8272
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8268
- Möbius Function
- 1
- Radical
- 16538
- 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
- 159
- 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
- yes
- Odd
- no
Appears in sequences
- Ratio A095107(n)/A095008(n) rounded to nearest integer.at n=14A095358
- a(n) = floor((1/16)*(16 + 2^n - 8*n + 8*n^2)).at n=18A130840
- a(n) = 25*n^2 - 14*n + 2.at n=26A154357
- Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=15A186393
- G.f.: (1+x)^(2*g)*(1+x^3)^(3*g)/((1-x^2)*(1-x^4))-x^(2*g)*(1+x)^4/((1-x^2)*(1-x^4)) for g=3.at n=17A199629
- Number of partitions of n such that the number of parts and the smallest part are coprime.at n=35A200928
- Number of n X 3 binary arrays with every 1 immediately preceded by 0 to the left or above.at n=5A203357
- Number of nX6 binary arrays with every 1 immediately preceded by 0 to the left or above.at n=2A203360
- T(n,k)=Number of nXk binary arrays with every 1 immediately preceded by 0 to the left or above.at n=30A203362
- T(n,k)=Number of nXk binary arrays with every 1 immediately preceded by 0 to the left or above.at n=33A203362
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 526", based on the 5-celled von Neumann neighborhood.at n=37A272744
- Numbers n such that there are precisely 2 groups of order n and 3 of order n + 1.at n=15A296025
- Number of nX4 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A299524
- Number of nX7 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=3A299527
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=48A299528
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=51A299528