Recognised as Number
77,928
- Positive
- Even
- Composite
- 5 digits
77,928 is an even 5-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value77,928
Digit count5
Digit sum33
Digit product7,056
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^3 × 3 × 17 × 191
Distinct prime factors42, 3, 17, 191
Number of divisors32
Sum of divisors σ(n)207,360
Aliquot sum129,432sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)24,320integers below n that share no factor with it
Carmichael function λ(n)1,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,320
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 17, 24, 34, 51, 68, 102, 136, 191, 204, 382, 408, 573, 764, 1,146, 1,528, 2,292, 3,247, 4,584, 6,494, 9,741, 12,988, 19,482, 25,976, 38,964, 77,92832 in total
Arithmetic
Representations
Decimal77,928
Binary1001100000110100017 bits
Octal230150
Hexadecimal13068
Base 361O4O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, nine hundred and twenty-eight
Ordinalseventy-seven thousand, nine hundred and twenty-eighth
Scientific notation7.7928 × 10^4
Engineering notation77.928 × 10^3
In other bases
Ternary10221220020base 3; the most digit-efficient integer base after e: 11 digits
Quinary4443203base 5; one hand: 7 digits
Septenary443124base 7: 6 digits
Nonary127806base 9; each digit is two ternary digits: 6 digits
Duodecimal39120base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9eg8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:38:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1100T0T01T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000110111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011000001101000
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 33 trailing zeros
Power of twoNo
Bytes301 30 68
Gray code11010100001011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011000001101000
64-bit0000000000000000000000000000000000000000000000010011000001101000
One's complement11111111111111101100111110010111at 32 bits, every bit flipped
Bits reversed00010110000011001000000000000000at 32 bits
Rotated left by 100000000000000100110000011010000at 32 bits, wrapping
Shifted left by 1100110000011010000= 155,856, no wrap
Shifted right by 11001100000110100= 38,964, discarding the low bit
These bits as a double3.85015476 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,928 to the power 26,072,773,184
77,928 to the power 3473,239,068,682,752
77,928 to the power 436,878,574,144,309,497,856
77,928 to the power 52,873,873,525,917,750,548,922,368
First ten multiples77,928, 155,856, 233,784, 311,712, 389,640, 467,568, 545,496, 623,424, 701,352, 779,280
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 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 8
Divisible by 11No, remainder 4
Divisible by 12Yes
Divisible by 100No, remainder 28
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached77,928
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,928 → 38,964 → 19,482 → 9,741 → 29,224 → 14,612 → 7,306 → 3,653 → 10,960 → 5,480 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,792,800%
77,928% as a decimal779.28
77,928% of 10077,928
77,928% of 1,000779,280
As a fraction of 10077,928/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 77,928
Nerdulate something else
Nothing in mind? Surprise me · today’s page