Recognised as Number
73,572
- Positive
- Even
- Composite
- 5 digits
73,572 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value73,572
Digit count5
Digit sum24
Digit product1,470
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 6,131
Distinct prime factors32, 3, 6,131
Number of divisors12
Sum of divisors σ(n)171,696
Aliquot sum98,124sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)24,520integers below n that share no factor with it
Carmichael function λ(n)6,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 6,131, 12,262, 18,393, 24,524, 36,786, 73,57212 in total
Arithmetic
Representations
Decimal73,572
Binary1000111110110010017 bits
Octal217544
Hexadecimal11F64
Base 361KRO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-three thousand, five hundred and seventy-two
Ordinalseventy-three thousand, five hundred and seventy-second
Scientific notation7.3572 × 10^4
Engineering notation73.572 × 10^3
In other bases
Ternary10201220220base 3; the most digit-efficient integer base after e: 11 digits
Quinary4323242base 5; one hand: 7 digits
Septenary424332base 7: 6 digits
Nonary121826base 9; each digit is two ternary digits: 6 digits
Duodecimal366b0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal93icbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:26:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1T0T10T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000010100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001111101100100
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 1f 64
Gray code11001000011010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001111101100100
64-bit0000000000000000000000000000000000000000000000010001111101100100
One's complement11111111111111101110000010011011at 32 bits, every bit flipped
Bits reversed00100110111110001000000000000000at 32 bits
Rotated left by 100000000000000100011111011001000at 32 bits, wrapping
Shifted left by 1100011111011001000= 147,144, no wrap
Shifted right by 11000111110110010= 36,786, discarding the low bit
These bits as a double3.63493977 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
73,572 to the power 25,412,839,184
73,572 to the power 3398,233,404,445,248
73,572 to the power 429,298,828,031,845,785,856
73,572 to the power 52,155,573,375,958,958,156,997,632
First ten multiples73,572, 147,144, 220,716, 294,288, 367,860, 441,432, 515,004, 588,576, 662,148, 735,720
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached73,572
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps73,572 → 36,786 → 18,393 → 55,180 → 27,590 → 13,795 → 41,386 → 20,693 → 62,080 → 31,040 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,357,200%
73,572% as a decimal735.72
73,572% of 10073,572
73,572% of 1,000735,720
As a fraction of 10073,572/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 73,572
Nerdulate something else
Nothing in mind? Surprise me · today’s page