16362
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 37026
- Proper Divisor Sum (Aliquot Sum)
- 20664
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5400
- Möbius Function
- 0
- Radical
- 606
- Omega Function (Ω)
- 6
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 66
- 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
- a(n) = floor(X/Y) where X = concatenation in decreasing order of (2n)-th even number to (n+1)-th even number and Y = that of first n even numbers in increasing order.at n=9A067092
- G.f.: A(x) = (A_1)^3 where A_1 = 1/[1 - x*(A_2)^3], A_2 = 1/[1 - x^2*(A_3)^3], A_3 = 1/[1 - x^3*(A_4)^3], ... A_n = 1/[1 - x^n*(A_{n+1})^3] for n>=1.at n=10A132335
- Averages of twin primes of the form : i^2+j^2, as sum of two squares.at n=28A143793
- Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks of size 3, i.e., blocks of the form (i,i+1,i+2) (0 <= k <= floor(n/3)).at n=48A184176
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=38A228963
- Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=6A228964
- a(n) = 4^n - 3*n - 1.at n=6A289254
- 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 625", based on the 5-celled von Neumann neighborhood.at n=13A289965
- p-INVERT of the positive integers, where p(S) = (1 - S^3)^2.at n=10A290928
- Numerator coefficients of the bivariate Maclaurin series ("inverse Kepler equation") developed as Lagrange inversion E=KeplerInv(e,M) of Kepler's equation M = Kepler(e,E) = E - e*sin(E).at n=22A306557
- Expansion of Product_{k>0} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=31A320067
- Averages k of twin primes such that the sum (with multiplicity) of prime factors of k-1, k and k+1 is prime.at n=34A340060
- Indices of the triangular numbers in A189475.at n=15A358417
- Rademacher's partition formula extended to half-integers. a(n) = round(sqrt(48) * (cosh(h(n)) - sinh(h(n))/h(n)) / (24*n + 11)) where h(n) = sqrt(24*n + 11)*(Pi/6).at n=35A376876