Number 72

Even Composite Positive

seventy-two

« 71 73 »

Basic Properties

Value72
In Wordsseventy-two
Absolute Value72
SignPositive (+)
Is EvenYes
Is OddNo
Is PrimeNo
Is CompositeYes
Is Perfect SquareNo
Is Perfect CubeNo
Is Power of 2No
Roman NumeralLXXII
Square (n²)5184
Cube (n³)373248
Reciprocal (1/n)0.01388888889

Factors & Divisors

Factors 1 2 3 4 6 8 9 12 18 24 36 72
Number of Divisors12
Sum of Proper Divisors123
Prime Factorization 2 × 2 × 2 × 3 × 3
Is Perfect NumberNo
Is AbundantYes
Is DeficientNo

Number Theory

Digit Sum9
Digital Root9
Number of Digits2
Is PalindromeNo
Is Armstrong NumberNo
Is Harshad NumberYes
Is Fibonacci NumberNo
Collatz Steps to 122
Goldbach Partition 5 + 67
Next Prime 73
Previous Prime 71

Trigonometric Functions

sin(72)0.2538233628
cos(72)-0.9672505883
tan(72)-0.2624173775
arctan(72)1.556908331
sinh(72)9.293358726E+30
cosh(72)9.293358726E+30
tanh(72)1

Roots & Logarithms

Square Root8.485281374
Cube Root4.160167646
Natural Logarithm (ln)4.276666119
Log Base 101.857332496
Log Base 26.169925001

Number Base Conversions

Binary (Base 2)1001000
Octal (Base 8)110
Hexadecimal (Base 16)48
Base64NzI=

Cryptographic Hashes

MD532bb90e8976aab5298d5da10fe66f21d
SHA-1c097638f92de80ba8d6c696b26e6e601a5f61eb7
SHA-2568722616204217eddb39e7df969e0698aed8e599ba62ed2de1ce49b03ade0fede
SHA-5128bd4964ded25d2608bbfd709784f9ca9893b6e3e51ec556d7c368c561a2c4f4135266ec7bb6fdeb3651213ea2a8eaf2ef3711b8a51f86c3816c821a62d2694ea

Initialize 72 in Different Programming Languages

LanguageCode
C#int number = 72;
C/C++int number = 72;
Javaint number = 72;
JavaScriptconst number = 72;
TypeScriptconst number: number = 72;
Pythonnumber = 72
Rubynumber = 72
PHP$number = 72;
Govar number int = 72
Rustlet number: i32 = 72;
Swiftlet number = 72
Kotlinval number: Int = 72
Scalaval number: Int = 72
Dartint number = 72;
Rnumber <- 72L
MATLABnumber = 72;
Lualocal number = 72
Perlmy $number = 72;
Haskellnumber :: Int number = 72
Elixirnumber = 72
Clojure(def number 72)
F#let number = 72
Visual BasicDim number As Integer = 72
Pascal/Delphivar number: Integer = 72;
SQLDECLARE @number INT = 72;
Bashnumber=72
PowerShell$number = 72

Fun Facts about 72

  • The number 72 is seventy-two.
  • 72 is an even number.
  • 72 is a composite number with 12 divisors.
  • 72 is a Harshad number — it is divisible by the sum of its digits (9).
  • 72 is an abundant number — the sum of its proper divisors (123) exceeds it.
  • The digit sum of 72 is 9, and its digital root is 9.
  • The prime factorization of 72 is 2 × 2 × 2 × 3 × 3.
  • Starting from 72, the Collatz sequence reaches 1 in 22 steps.
  • 72 can be expressed as the sum of two primes: 5 + 67 (Goldbach's conjecture).
  • In Roman numerals, 72 is written as LXXII.
  • In binary, 72 is 1001000.
  • In hexadecimal, 72 is 48.

About the Number 72

Overview

The number 72, spelled out as seventy-two, is an even positive integer. In mathematics, every integer has a unique set of properties that define its role in arithmetic, algebra, and number theory. On this page we explore everything there is to know about the number 72 — from its divisibility and prime factorization to its trigonometric values, binary representation, and cryptographic hashes.

Parity and Sign

The number 72 is even, which means it is exactly divisible by 2 with no remainder. Even numbers play a fundamental role in mathematics — they form one of the two basic parity classes and appear in many divisibility rules, algebraic identities, and combinatorial arguments.As a positive number, 72 lies to the right of zero on the number line. Its absolute value is 72.

Primality and Factorization

72 is a composite number, meaning it has divisors other than 1 and itself. Specifically, 72 has 12 divisors: 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72. The sum of its proper divisors (all divisors except 72 itself) is 123, which makes 72 an abundant number, since 123 > 72. Abundant numbers are integers where the sum of proper divisors exceeds the number.

The prime factorization of 72 is 2 × 2 × 2 × 3 × 3. Prime factorization is essential for computing the greatest common divisor (GCD) and least common multiple (LCM), simplifying fractions, and solving problems in modular arithmetic. The nearest primes to 72 are 71 and 73.

Special Classifications

Beyond basic primality, number theorists have identified many special categories that a number can belong to. 72 is a Harshad number (from Sanskrit “joy-giver”) — it is divisible by the sum of its digits (9). Harshad numbers connect divisibility theory with digit-based properties of integers.

Digit Properties

The digits of 72 sum to 9, and its digital root (the single-digit value obtained by repeatedly summing digits) is 9. The number 72 has 2 digits in its decimal representation. Digit sums are fundamental to divisibility tests: a number is divisible by 3 if and only if its digit sum is divisible by 3, and the same holds for divisibility by 9. The digital root, also known as the repeated digital sum, has applications in casting out nines — a centuries-old technique for verifying arithmetic calculations.

Number Base Conversions

In the binary (base-2) number system, 72 is represented as 1001000. Binary is the language of digital computers — every file, image, video, and program is ultimately stored as a sequence of binary digits (bits). In octal (base-8), 72 is 110, a system historically used in computing because each octal digit corresponds to exactly three binary digits. In hexadecimal (base-16), 72 is 48 — hex is ubiquitous in programming for representing memory addresses, color codes (#FF5733), and byte values.

The Base64 encoding of the string “72” is NzI=. Base64 is widely used in web development for encoding binary data in URLs, email attachments (MIME), JSON Web Tokens (JWT), and data URIs in HTML and CSS.

Mathematical Functions

The square of 72 is 5184 (i.e. 72²), and its square root is approximately 8.485281. The cube of 72 is 373248, and its cube root is approximately 4.160168. The reciprocal (1/72) is 0.01388888889.

The natural logarithm (ln) of 72 is 4.276666, the base-10 logarithm is 1.857332, and the base-2 logarithm is 6.169925. Logarithms are essential in measuring earthquake magnitudes (Richter scale), sound levels (decibels), acidity (pH), and information content (bits).

Trigonometry

Treating 72 as an angle in radians, the principal trigonometric functions yield: sin(72) = 0.2538233628, cos(72) = -0.9672505883, and tan(72) = -0.2624173775. The hyperbolic functions give: sinh(72) = 9.293358726E+30, cosh(72) = 9.293358726E+30, and tanh(72) = 1. Trigonometric functions are indispensable in physics (wave motion, oscillations, alternating current), engineering (signal processing, structural analysis), computer graphics (rotations, projections), and navigation (GPS, celestial mechanics).

Cryptographic Hashes

When the string “72” is passed through standard cryptographic hash functions, the results are: MD5: 32bb90e8976aab5298d5da10fe66f21d, SHA-1: c097638f92de80ba8d6c696b26e6e601a5f61eb7, SHA-256: 8722616204217eddb39e7df969e0698aed8e599ba62ed2de1ce49b03ade0fede, and SHA-512: 8bd4964ded25d2608bbfd709784f9ca9893b6e3e51ec556d7c368c561a2c4f4135266ec7bb6fdeb3651213ea2a8eaf2ef3711b8a51f86c3816c821a62d2694ea. Cryptographic hashes are one-way functions that produce a fixed-size output from any input. They are used for data integrity verification (detecting file corruption or tampering), password storage (storing hashes instead of plaintext passwords), digital signatures, blockchain technology (Bitcoin uses SHA-256), and content addressing (Git uses SHA-1 to identify objects).

Collatz Conjecture

The Collatz conjecture (also known as the 3n + 1 problem) is one of the most famous unsolved problems in mathematics. Starting from 72 and repeatedly applying the rule — divide by 2 if even, multiply by 3 and add 1 if odd — the sequence reaches 1 in 22 steps. Despite its simplicity, no one has been able to prove that this process always terminates for every starting number, and the conjecture remains open since it was first proposed by Lothar Collatz in 1937.

Goldbach’s Conjecture

According to Goldbach’s conjecture, every even integer greater than 2 can be expressed as the sum of two prime numbers. For 72, one such partition is 5 + 67 = 72. This conjecture, proposed in 1742 by Christian Goldbach in a letter to Leonhard Euler, has been verified computationally for all even numbers up to at least 4 × 1018, but a general proof remains elusive.

Roman Numerals

In the Roman numeral system, 72 is written as LXXII. Roman numerals originated in ancient Rome and use combinations of letters (I, V, X, L, C, D, M) with subtractive notation for certain values. They remain in use today on clock faces, in book chapters, film sequels, and formal outlines.

Programming

In software development, the number 72 can be represented across dozens of programming languages. For example, in C# you would write int number = 72;, in Python simply number = 72, in JavaScript as const number = 72;, and in Rust as let number: i32 = 72;. Math.Number provides initialization code for 27 programming languages, making it a handy quick-reference for developers working across different technology stacks.

Related Numbers

Nearby Numbers