Nerdulator> put something in

Recognised as Number

72,832

  • Positive
  • Even
  • Composite
  • 5 digits

72,832 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value72,832
Digit count5
Digit sum22
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^7 × 569
Distinct prime factors22, 569
Number of divisors16
Sum of divisors σ(n)145,350
Aliquot sum72,518sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,352integers below n that share no factor with it
Carmichael function λ(n)2,272the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 36,352
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 569, 1,138, 2,276, 4,552, 9,104, 18,208, 36,416, 72,83216 in total

Arithmetic

Previous number72,831
Next number72,833
Double145,664
Half36,416
Square root269.874044695≈irrational, shown to 9 decimal places
Cube root41.761306654≈
Negation-72,832
Reciprocal0.0000137302≈

Representations

Decimal72,832
Binary1000111001000000017 bits
Octal216200
Hexadecimal11C80
Base 361K74
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-two thousand, eight hundred and thirty-two
Ordinalseventy-two thousand, eight hundred and thirty-second
Scientific notation7.2832 × 10^4
Engineering notation72.832 × 10^3

In other bases

Ternary10200220111base 3; the most digit-efficient integer base after e: 11 digits
Quinary4312312base 5; one hand: 7 digits
Septenary422224base 7: 6 digits
Nonary120814base 9; each digit is two ternary digits: 6 digits
Duodecimal36194base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal921cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:13:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T010T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110110000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010001110010000000
Bit length17 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits12within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 77 trailing zeros
Power of twoNo
Bytes301 1c 80
Gray code11001001011000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010001110010000000
64-bit0000000000000000000000000000000000000000000000010001110010000000
One's complement11111111111111101110001101111111at 32 bits, every bit flipped
Bits reversed00000001001110001000000000000000at 32 bits
Rotated left by 100000000000000100011100100000000at 32 bits, wrapping
Shifted left by 1100011100100000000= 145,664, no wrap
Shifted right by 11000111001000000= 36,416, discarding the low bit
These bits as a double3.59837891 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime72,859+27
Previous prime72,823−9
Distance to nearest prime9
Nearest square below72,361
Nearest square above72,900

Powers & multiples

72,832 to the power 25,304,500,224
72,832 to the power 3386,337,360,314,368
72,832 to the power 428,137,722,626,416,050,176
72,832 to the power 52,049,326,614,327,133,766,418,432
First ten multiples72,832, 145,664, 218,496, 291,328, 364,160, 436,992, 509,824, 582,656, 655,488, 728,320
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 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time
Highest value reached72,832
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps72,832 → 36,416 → 18,208 → 9,104 → 4,552 → 2,276 → 1,138 → 569 → 1,708 → 854 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,283,200%
72,832% as a decimal728.32
72,832% of 10072,832
72,832% of 1,000728,320
As a fraction of 10072,832/100

Read another way

As bytes71.125 KiB
As a 24-bit colour#011C80

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “72832” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.