Recognised as Number
77,752
- Positive
- Even
- Composite
- 5 digits
77,752 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value77,752
Digit count5
Digit sum28
Digit product3,430
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 9,719
Distinct prime factors22, 9,719
Number of divisors8
Sum of divisors σ(n)145,800
Aliquot sum68,048sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,872integers below n that share no factor with it
Carmichael function λ(n)9,718the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,872
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 9,719, 19,438, 38,876, 77,7528 in total
Arithmetic
Representations
Decimal77,752
Binary1001011111011100017 bits
Octal227670
Hexadecimal12FB8
Base 361NZS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, seven hundred and fifty-two
Ordinalseventy-seven thousand, seven hundred and fifty-second
Scientific notation7.7752 × 10^4
Engineering notation77.752 × 10^3
In other bases
Ternary10221122201base 3; the most digit-efficient integer base after e: 11 digits
Quinary4442002base 5; one hand: 7 digits
Septenary442453base 7: 6 digits
Nonary127581base 9; each digit is two ternary digits: 6 digits
Duodecimal38bb4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9e7cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:35:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1100TT00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000011001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010111110111000
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 2f b8
Gray code11011100001100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010111110111000
64-bit0000000000000000000000000000000000000000000000010010111110111000
One's complement11111111111111101101000001000111at 32 bits, every bit flipped
Bits reversed00011101111101001000000000000000at 32 bits
Rotated left by 100000000000000100101111101110000at 32 bits, wrapping
Shifted left by 1100101111101110000= 155,504, no wrap
Shifted right by 11001011111011100= 38,876, discarding the low bit
These bits as a double3.84145921 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,752 to the power 26,045,373,504
77,752 to the power 3470,039,880,683,008
77,752 to the power 436,546,540,802,865,238,016
77,752 to the power 52,841,566,640,504,377,986,220,032
First ten multiples77,752, 155,504, 233,256, 311,008, 388,760, 466,512, 544,264, 622,016, 699,768, 777,520
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 3
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1125the total stopping time
Highest value reached77,752
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,752 → 38,876 → 19,438 → 9,719 → 29,158 → 14,579 → 43,738 → 21,869 → 65,608 → 32,804 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,775,200%
77,752% as a decimal777.52
77,752% of 10077,752
77,752% of 1,000777,520
As a fraction of 10077,752/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,752
Nerdulate something else
Nothing in mind? Surprise me · today’s page