17869
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 31
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17596
- Möbius Function
- 1
- Radical
- 17869
- 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
- 141
- 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
- Expansion of e.g.f. arctanh(cosh(x) * log(x+1)).at n=7A012761
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones.at n=13A031852
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=49A073798
- Smallest integer at which the value of truncated Mertens function equals 2^n.at n=10A093776
- 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, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1), (1, 1, 1)}.at n=7A150997
- G.f. satisfies: A(x) = 1 + x*A(x) + x^2*A(x)^4.at n=9A186996
- Half the number of 0..n arrays of length 4 with second differences nonzero.at n=12A212783
- Odd indices n for which A046825(n) is not larger than A046825(n-1).at n=46A214453
- Number of nX3 arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 7.at n=4A264817
- T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 7.at n=25A264818
- Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity.at n=20A363391
- Squarefree semiprimes k such that k+1 is the product of three distinct primes and k+2 is the product of four distinct primes.at n=17A376352
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(3*n-2*r+k,r) * binomial(r,n-r)/(3*n-2*r+k) for k > 0.at n=64A378291