17866
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 26802
- Proper Divisor Sum (Aliquot Sum)
- 8936
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8932
- Möbius Function
- 1
- Radical
- 17866
- 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
- yes
- Odd
- no
Appears in sequences
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=46A073798
- a(n) = (5*n^3+12*n^2+n+6)/6.at n=27A114211
- A triangular array of numbers related to factorization and number of parts in Murasaki diagrams.at n=49A133611
- Triangle read by rows, A008277 * A000012.at n=39A137650
- Number of prime parts in the last section of the set of partitions of n.at n=36A144120
- a(n) is the number of zeros needed to write the integers 1 through Fibonacci(n).at n=23A155881
- Number of nonnegative integer arrays of length n+3 with new values 0 upwards introduced in order, and containing the value 3.at n=5A211557
- T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1.at n=41A211561
- Number of nonnegative integer arrays of length n+5 with new values 0 upwards introduced in order, and containing the value n-1.at n=3A211565
- Number of binary Lyndon words of length n having a conjugate at Hamming distance 2.at n=29A226893
- Expansion of 1/(2 + x - theta_2(sqrt(x))/(2*x^(1/8))), where theta_2() is the Jacobi theta function.at n=56A303908
- The number of free polyiamonds with n cells on an order-7 triangular tiling of the hyperbolic plane.at n=13A330659
- The index of prime(n) in A337182.at n=28A338222
- Number of permutations of [1..n] which are indecomposable by direct and skew sums.at n=8A359856
- Number of regions in the hyperoctahedral (or cocktail party) graph of order n.at n=13A368755
- Expansion of (1/x) * Series_Reversion( x/(x+1/(1-x+x^2)) ).at n=11A370799
- Consecutive states of the linear congruential pseudo-random number generator 228*s mod (2^16+1) when started at s=1.at n=32A385079