Recognised as Number
82,572
- Positive
- Even
- Composite
- 5 digits
82,572 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value82,572
Digit count5
Digit sum24
Digit product1,120
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 × 7 × 983
Distinct prime factors42, 3, 7, 983
Number of divisors24
Sum of divisors σ(n)220,416
Aliquot sum137,844sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)23,568integers below n that share no factor with it
Carmichael function λ(n)2,946the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,568
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 983, 1,966, 2,949, 3,932, 5,898, 6,881, 11,796, 13,762, 20,643, 27,524, 41,286, 82,57224 in total
Arithmetic
Representations
Decimal82,572
Binary1010000101000110017 bits
Octal241214
Hexadecimal1428C
Base 361RPO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-two thousand, five hundred and seventy-two
Ordinaleighty-two thousand, five hundred and seventy-second
Scientific notation8.2572 × 10^4
Engineering notation82.572 × 10^3
In other bases
Ternary11012021020base 3; the most digit-efficient integer base after e: 11 digits
Quinary10120242base 5; one hand: 8 digits
Septenary462510base 7: 6 digits
Nonary135236base 9; each digit is two ternary digits: 6 digits
Duodecimal3b950base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimala68cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal22:56:12base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary111TT1T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100011110011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010100001010001100
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 22 trailing zeros
Power of twoNo
Bytes301 42 8c
Gray code11110001111001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010100001010001100
64-bit0000000000000000000000000000000000000000000000010100001010001100
One's complement11111111111111101011110101110011at 32 bits, every bit flipped
Bits reversed00110001010000101000000000000000at 32 bits
Rotated left by 100000000000000101000010100011000at 32 bits, wrapping
Shifted left by 1101000010100011000= 165,144, no wrap
Shifted right by 11010000101000110= 41,286, discarding the low bit
These bits as a double4.07959885 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
82,572 to the power 26,818,135,184
82,572 to the power 3562,987,058,413,248
82,572 to the power 446,486,967,387,298,713,856
82,572 to the power 53,838,521,871,104,029,400,517,632
First ten multiples82,572, 165,144, 247,716, 330,288, 412,860, 495,432, 578,004, 660,576, 743,148, 825,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 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1151the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps82,572 → 41,286 → 20,643 → 61,930 → 30,965 → 92,896 → 46,448 → 23,224 → 11,612 → 5,806 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,257,200%
82,572% as a decimal825.72
82,572% of 10082,572
82,572% of 1,000825,720
As a fraction of 10082,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 82,572
Nerdulate something else
Nothing in mind? Surprise me · today’s page