16382
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 24576
- Proper Divisor Sum (Aliquot Sum)
- 8194
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8190
- Möbius Function
- 1
- Radical
- 16382
- 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
- 159
- 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
- a(n) = 2^n - 2.at n=14A000918
- a(2*n) = 3*2^n - 2; a(2*n+1) = 2^(n+2) - 2.at n=25A027383
- Numbers n such that uphi(sigma(n)) = n, where the uphi is the unitary phi function A047994.at n=22A030164
- Becomes prime or 4 after exactly 9 iterations of f(x) = sum of prime factors of x.at n=7A048131
- Numbers k such that 171*2^k-1 is prime.at n=32A050837
- Number of palindromes of length n using exactly two different symbols.at n=27A056453
- Number of palindromes of length n using exactly two different symbols.at n=26A056453
- Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.at n=13A060590
- Biased numbers: n such that all terms of the sequence f(n), f(f(n)), f(f(f(n))), ..., 1, where f(k) = floor(k/2), are odd.at n=24A066880
- a(0) = 1; a(n) = a(n-1)+1 if n is even, otherwise a(n) = 2*a(n-1).at n=25A075427
- Largest term in periodic part of continued fraction expansion of square root of -1+2^n or 0 if -1+2^n is square.at n=25A077625
- 2^(n-1) - (prime(n) mod n).at n=14A077686
- Expansion of (1-x+2x^2)/((1-x)*(1-2x)).at n=13A095121
- Values of k such that the total number of 1's in the binary expansions of the first k integers is a multiple of k.at n=22A095376
- Divisors of perfect numbers (A000396), sorted.at n=32A096360
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.at n=43A105640
- Semiprimes of the form 2*(m^2 + m + 1) (implying that m^2 + m + 1 is a prime).at n=30A107317
- Numbers of the forms 2^n-2, 2^n-1, 2^n, 2^n+1 and 2^n+2.at n=62A108155
- Let S(n)=Sigma(n)/2. Numbers n such that S(S(n))=n, 1/2-Sociable number of order 1 or 2.at n=19A113791
- Semiprime nearest to 2^n. (In case of a tie, choose the smaller).at n=14A117405