Recognised as Number
72,836
- Positive
- Even
- Composite
- 5 digits
72,836 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value72,836
Digit count5
Digit sum26
Digit product2,016
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 131 × 139
Distinct prime factors32, 131, 139
Number of divisors12
Sum of divisors σ(n)129,360
Aliquot sum56,524sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,880integers below n that share no factor with it
Carmichael function λ(n)8,970the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,880
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 131, 139, 262, 278, 524, 556, 18,209, 36,418, 72,83612 in total
Arithmetic
Representations
Decimal72,836
Binary1000111001000010017 bits
Octal216204
Hexadecimal11C84
Base 361K78
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-two thousand, eight hundred and thirty-six
Ordinalseventy-two thousand, eight hundred and thirty-sixth
Scientific notation7.2836 × 10^4
Engineering notation72.836 × 10^3
In other bases
Ternary10200220122base 3; the most digit-efficient integer base after e: 11 digits
Quinary4312321base 5; one hand: 7 digits
Septenary422231base 7: 6 digits
Nonary120818base 9; each digit is two ternary digits: 6 digits
Duodecimal36198base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal921gbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:13:56base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T010T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110110110000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001110010000100
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 1c 84
Gray code11001001011000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001110010000100
64-bit0000000000000000000000000000000000000000000000010001110010000100
One's complement11111111111111101110001101111011at 32 bits, every bit flipped
Bits reversed00100001001110001000000000000000at 32 bits
Rotated left by 100000000000000100011100100001000at 32 bits, wrapping
Shifted left by 1100011100100001000= 145,672, no wrap
Shifted right by 11000111001000010= 36,418, discarding the low bit
These bits as a double3.59857654 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
72,836 to the power 25,305,082,896
72,836 to the power 3386,401,017,813,056
72,836 to the power 428,143,904,533,431,746,816
72,836 to the power 52,049,889,430,597,034,711,090,176
First ten multiples72,836, 145,672, 218,508, 291,344, 364,180, 437,016, 509,852, 582,688, 655,524, 728,360
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 36
Collatz (3n + 1) trajectory
Steps to reach 150the total stopping time
Highest value reached72,836
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps72,836 → 36,418 → 18,209 → 54,628 → 27,314 → 13,657 → 40,972 → 20,486 → 10,243 → 30,730 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,283,600%
72,836% as a decimal728.36
72,836% of 10072,836
72,836% of 1,000728,360
As a fraction of 10072,836/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,836
Nerdulate something else
Nothing in mind? Surprise me · today’s page