16896
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 49104
- Proper Divisor Sum (Aliquot Sum)
- 32208
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5120
- Möbius Function
- 0
- Radical
- 66
- Omega Function (Ω)
- 11
- 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
- 35
- Smith Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Pentagonal pyramidal numbers: a(n) = n^2*(n+1)/2.at n=32A002411
- Number of pairings {(b(1), c(1)), (b(2), c(2)), ..., (b(n), c(n))} of the first 2n positive integers satisfying b(i) < c(i) and such that the 2n numbers c(i)+b(i) and c(i)-b(i) are all distinct.at n=9A002968
- Numbers that are the sum of 5 positive 7th powers.at n=25A003372
- Even pentagonal pyramidal numbers.at n=24A015224
- a(n) = n*(31*n + 1)/2.at n=33A022289
- Expansion of Product_{m>=1} (1+x^m)^3.at n=20A022568
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 2. Also a(n) = (2^n)*C(n-1), where C = A000108 (Catalan numbers).at n=6A025225
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 17 (most significant digit on right).at n=15A029510
- A convolution triangle of numbers obtained from A001792.at n=46A030523
- A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=47A049325
- Triangle of partial row sums (prs) of triangle A055252.at n=46A055584
- Second column of triangle A055584.at n=8A055585
- a(n) = T(2n+5,n), array T as in A055807.at n=4A055817
- Number of orbits of length n in map whose periodic points are A059928.at n=61A060478
- 11-almost primes (generalization of semiprimes).at n=15A069272
- Smallest number k for which the set of solutions to phi(x) = k has 2n-1 entries.at n=42A071387
- a(n) = (8^n + 4^n)/2.at n=5A081337
- Number of n X n circulant singular (0,1) matrices over the reals.at n=15A086328
- a(n) = 4n^3 + 2n^2.at n=15A089207
- Number of closed walks of length n on the Petersen graph rooted at a given vertex.at n=11A091000