diff --git a/bazel/BUILD b/bazel/BUILD
index b08bf4ecd2..a891d615a2 100644
--- a/bazel/BUILD
+++ b/bazel/BUILD
@@ -21,7 +21,7 @@ py_binary(
 )
 
 # py_proto_library() is private rule, only intended for internal use by upb.
-# Hopefully py_proto_library() will eventually be availble in rules_proto or
+# Hopefully py_proto_library() will eventually be available in rules_proto or
 # another upstream package.
 bzl_library(
     name = "py_proto_library_bzl",
diff --git a/protos_generator/tests/test_generated.cc b/protos_generator/tests/test_generated.cc
index 1206b6a998..121251b6a7 100644
--- a/protos_generator/tests/test_generated.cc
+++ b/protos_generator/tests/test_generated.cc
@@ -114,7 +114,7 @@ TEST(CppGeneratedCode, ScalarInt32) {
   // Test int32 defaults.
   EXPECT_EQ(testModel.value(), 0);
   EXPECT_FALSE(testModel.has_value());
-  // Floating point defautls.
+  // Floating point defaults.
   EXPECT_EQ(std::numeric_limits<float>::infinity(),
             testModel.float_value_with_default());
   EXPECT_EQ(-std::numeric_limits<double>::infinity(),
diff --git a/rust/utf8.rs b/rust/utf8.rs
index 05f4c499e3..56a1c20b93 100644
--- a/rust/utf8.rs
+++ b/rust/utf8.rs
@@ -241,7 +241,7 @@ impl<'a> Iterator for Utf8Chunks<'a> {
         /// # Safety
         /// `index` must be in-bounds for `x`
         unsafe fn split_at_unchecked(x: &[u8], index: usize) -> (&[u8], &[u8]) {
-            // SAFTEY: in-bounds as promised by the caller
+            // SAFETY: in-bounds as promised by the caller
             unsafe { (x.get_unchecked(..index), x.get_unchecked(index..)) }
         }
 
diff --git a/src/google/protobuf/compiler/cpp/file.cc b/src/google/protobuf/compiler/cpp/file.cc
index ec53d9d0ec..68b2640915 100644
--- a/src/google/protobuf/compiler/cpp/file.cc
+++ b/src/google/protobuf/compiler/cpp/file.cc
@@ -100,7 +100,7 @@ void UnmuteWuninitialized(io::Printer* p) {
 // in cases where we may declare proto B as a member of proto A using an object,
 // instead of a pointer.
 //
-// The proto dependencey graph can have cycles.  So instead of directly working
+// The proto dependency graph can have cycles.  So instead of directly working
 // with protos, we compute strong connected components (SCCs) composed of protos
 // with mutual dependence.  The dependency graph on SCCs is a directed acyclic
 // graph (DAG) and therefore a topological order can be computed for it i.e. an
diff --git a/src/google/protobuf/unknown_field_set_unittest.cc b/src/google/protobuf/unknown_field_set_unittest.cc
index ff1ed9ee07..dc2f6b830e 100644
--- a/src/google/protobuf/unknown_field_set_unittest.cc
+++ b/src/google/protobuf/unknown_field_set_unittest.cc
@@ -614,7 +614,7 @@ TEST_F(UnknownFieldSetTest, DeleteSubrange) {
 
 void CheckDeleteByNumber(const std::vector<int>& field_numbers,
                          int deleted_number,
-                         const std::vector<int>& expected_field_nubmers) {
+                         const std::vector<int>& expected_field_numbers) {
   UnknownFieldSet unknown_fields;
   for (int i = 0; i < field_numbers.size(); ++i) {
     unknown_fields.AddFixed32(field_numbers[i], i);
@@ -622,7 +622,7 @@ void CheckDeleteByNumber(const std::vector<int>& field_numbers,
   unknown_fields.DeleteByNumber(deleted_number);
   ASSERT_EQ(expected_field_nubmers.size(), unknown_fields.field_count());
   for (int i = 0; i < expected_field_nubmers.size(); ++i) {
-    EXPECT_EQ(expected_field_nubmers[i], unknown_fields.field(i).number());
+    EXPECT_EQ(expected_field_numbers[i], unknown_fields.field(i).number());
   }
 }