diff --git a/Project Euler/Problem 16/sol1.py b/Project Euler/Problem 16/sol1.py
new file mode 100644
index 000000000..05c7916bd
--- /dev/null
+++ b/Project Euler/Problem 16/sol1.py	
@@ -0,0 +1,15 @@
+power = int(input("Enter the power of 2: "))
+num = 2**power
+
+string_num = str(num)
+
+list_num = list(string_num)
+
+sum_of_num = 0
+
+print("2 ^",power,"=",num)
+
+for i in list_num:
+    sum_of_num += int(i)
+
+print("Sum of the digits are:",sum_of_num)
diff --git a/Project Euler/README.md b/Project Euler/README.md
index 5d7238e40..c9dc2b468 100644
--- a/Project Euler/README.md	
+++ b/Project Euler/README.md	
@@ -49,3 +49,6 @@ PROBLEMS:
     Using the rule above and starting with 13, we generate the following sequence:
     13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
     Which starting number, under one million, produces the longest chain?
+
+16. 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.
+    What is the sum of the digits of the number 2^1000?