16367
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 1273
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 15096
- Möbius Function
- 1
- Radical
- 16367
- 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
- 190
- 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
- All differences C(j)-C(i), j>i, of Catalan numbers A000108.at n=39A047075
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.at n=27A048222
- Integers n > 1997 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 1997.at n=31A063055
- Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=18A071392
- a(n+4) = a(n+1) - a(n), a(0) = 1, a(1) = -4, a(2) = 0, a(3) = 1.at n=53A110064
- a(n) = 1 + sum{p=primes<n, p does not divide n} a(p).at n=43A112479
- a(n) = n*(n^2 - 1)/2 - 1.at n=30A117560
- Expansion of 1/(1 - x - 3x^2 + x^3).at n=13A125691
- a(n) = the smallest positive multiple of n that has exactly n 1's in its binary representation.at n=12A143115
- Partial sums of A165271.at n=44A165273
- Fixed points of the mapping f(x) = (x + 2^x) mod (17 + x).at n=9A166118
- a(n) = n^5 - n^3 - 2*n^2 + 1.at n=7A177075
- Semiprimes of the form n^5-n^3-2*n^2+1.at n=1A177087
- Numbers which contain only the digit 3 in their base-4 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1 or 2, otherwise the exception must be the digit 2.at n=38A188529
- Expansion of psi(x^2) * phi(x^7) / (f(-x) * f(-x^7)) in powers of x where phi(), psi(), f() are Ramanujan theta functions.at n=29A193826
- Greatest number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=13A217114
- Number of nondecreasing -n..n vectors of length 5 whose dot product with some lexicographically greater or equal nondecreasing -n..n vector equals 5.at n=7A226426
- a(n) = A239839(n)/n! where A239839(n) is the number of ordered pairs of permutation functions on n elements where f(f(f(x))) = g(f(g(x))).at n=14A255516
- Where the difference A055938(n) - A005187(n) obtains record values; positions of records in A257126.at n=21A257130
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 529", based on the 5-celled von Neumann neighborhood.at n=13A288905