16096
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 31752
- Proper Divisor Sum (Aliquot Sum)
- 15656
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8032
- Möbius Function
- 0
- Radical
- 1006
- Omega Function (Ω)
- 6
- 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
- 71
- 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
- Number of positive integers <= 2^n of form x^2 + y^2.at n=16A000050
- a(n) = 3^n - n^5.at n=11A024028
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 3 (mod 5).at n=47A035564
- Numbers k such that k^2 is composed of three 1-digit-overlapping subsquares.at n=10A048426
- Numbers k for which phi(k) = phi(k+1) - phi(k-1).at n=23A076529
- Polynexus numbers of order 14.at n=3A088892
- Numbers n such that 4*10^n + 2*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=10A102986
- Product(1 + a(n)*x^n, n=1..infinity) = sum(F(k+1)*x^k, k=1..infinity) = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=26A147542
- Result of using the Fibonacci numbers as coefficients in an infinite polynomial series in x and then expressing this series as (1+a(1)x)(1+a(2)x^2)(1+a(3)x^3)...at n=26A147558
- Least m coprime to 3 minimizing A007947(m*(3^n-m)).at n=10A147802
- 1/Product_{n>=1} (1 - a(n)*x^n) = 1 + Sum_{k>=1} F(k+1)*x^k = 1/(1-x-x^2), where F(n) = A000045(n) (Fibonacci numbers).at n=26A157162
- Number of binary strings of length n with equal numbers of 0011 and 1100 substrings.at n=15A164175
- Values of x in A216363.at n=12A216382
- 10-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0,0,0.at n=24A251762
- a(n) = 4*n*(n^2 - 3*n - 1)/3.at n=24A275876
- p-INVERT of the odd positive integers, where p(S) = 1 - S + S^2 - S^3.at n=9A292492
- E.g.f.: exp(Sum_{n>=1} A000009(n)*x^n/n).at n=7A293839
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Sum_{j>=1} j^(k-1)*A000009(j)*x^j).at n=35A293908
- a(n) = 2*a(n-1) - a(n-3) + 2*a(floor(n/2)) + 3*a(floor(n/3)) + ... + n*a(floor(n/n)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=12A298409
- Indices of unique values in A329152.at n=18A333268