Recognised as Number
72,352
- Positive
- Even
- Composite
- 5 digits
72,352 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value72,352
Digit count5
Digit sum19
Digit product420
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 7 × 17 × 19
Distinct prime factors42, 7, 17, 19
Number of divisors48
Sum of divisors σ(n)181,440
Aliquot sum109,088sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)27,648integers below n that share no factor with it
Carmichael function λ(n)144the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,648
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 17, 19, 28, 32, 34, 38, 56, 68, 76, 112, 119, 133, 136, 152, 224, 238, 266, 272, 304, 323, 476, 532, 544, 608, 646, 952, 1,064, 1,292, 1,904, 2,128, 2,261, 2,584, 3,808, 4,256, 4,522, 5,168, 9,044, 10,336, 18,088, 36,176, 72,35248 in total
Arithmetic
Representations
Decimal72,352
Binary1000110101010000017 bits
Octal215240
Hexadecimal11AA0
Base 361JTS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-two thousand, three hundred and fifty-two
Ordinalseventy-two thousand, three hundred and fifty-second
Scientific notation7.2352 × 10^4
Engineering notation72.352 × 10^3
In other bases
Ternary10200020201base 3; the most digit-efficient integer base after e: 11 digits
Quinary4303402base 5; one hand: 7 digits
Septenary420640base 7: 6 digits
Nonary120221base 9; each digit is two ternary digits: 6 digits
Duodecimal35a54base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal90hcbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:5:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T001T1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110111111100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001101010100000
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes301 1a a0
Gray code11001011111110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001101010100000
64-bit0000000000000000000000000000000000000000000000010001101010100000
One's complement11111111111111101110010101011111at 32 bits, every bit flipped
Bits reversed00000101010110001000000000000000at 32 bits
Rotated left by 100000000000000100011010101000000at 32 bits, wrapping
Shifted left by 1100011010101000000= 144,704, no wrap
Shifted right by 11000110101010000= 36,176, discarding the low bit
These bits as a double3.57466376 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
72,352 to the power 25,234,811,904
72,352 to the power 3378,749,110,878,208
72,352 to the power 427,403,255,670,260,105,216
72,352 to the power 51,982,680,354,254,659,132,588,032
First ten multiples72,352, 144,704, 217,056, 289,408, 361,760, 434,112, 506,464, 578,816, 651,168, 723,520
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 124the total stopping time
Highest value reached72,352
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps72,352 → 36,176 → 18,088 → 9,044 → 4,522 → 2,261 → 6,784 → 3,392 → 1,696 → 848 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,235,200%
72,352% as a decimal723.52
72,352% of 10072,352
72,352% of 1,000723,520
As a fraction of 10072,352/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 72,352
Nerdulate something else
Nothing in mind? Surprise me · today’s page