Recognised as Number
87,775,320,361
- Positive
- Odd
- Composite
- Perfect square
- 11 digits
87,775,320,361 is an odd 11-digit integer and a composite number. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value87,775,320,361
Digit count11
Digit sum49
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 296,269²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation296,269^2
Distinct prime factors1296,269
Number of divisors3
Sum of divisors σ(n)87,775,616,631
Aliquot sum296,270sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)87,775,024,092integers below n that share no factor with it
Carmichael function λ(n)87,775,024,092the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 296,269, 87,775,320,3613 in total
Arithmetic
Previous number87,775,320,360
Next number87,775,320,362
Double175,550,640,722
Half43,887,660,180.5
Square7,704,506,864,476,181,170,321
Cube676,265,558,252,920,412,678,801,680,205,881
Square root296,269exact
Cube root4,444.17147729≈
Negation-87,775,320,361
Reciprocal1.1392724 × 10^-11≈
Representations
Decimal87,775,320,361
Binary101000110111111010001000110010010100137 bits
Octal1215764214451
Hexadecimal146FD11929
Base 3614BN5QND
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-seven billion, seven hundred and seventy-five million, three hundred and twenty thousand, three hundred and sixty-one
Ordinaleighty-seven billion, seven hundred and seventy-five million, three hundred and twenty thousand, three hundred and sixty-first
Scientific notation8.77753204 × 10^10
Engineering notation87.77532 × 10^9
In other bases
Ternary22101120012202021101011base 3; the most digit-efficient integer base after e: 23 digits
Quinary2414230440222421base 5; one hand: 16 digits
Septenary6225103625041base 7: 13 digits
Nonary271505667334base 9; each digit is two ternary digits: 12 digits
Duodecimal1501793aba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal38b9ff0i1base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal1:52:52:47:13:26:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T11TTT01T0T1T1T1101011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010110110000110100010110100101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000001010001101111110100010001100100101001
Bit length37 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits19within that length
Bit parityeven18 set bits, so even; not the same as the number itself being odd
Highest set bitbit 36worth 68,719,476,736
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes514 6f d1 19 29
Gray code1111001011000001110011001010110111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000001010001101111110100010001100100101001
One's complement1111111111111111111111111110101110010000001011101110011011010110at 64 bits, every bit flipped
Bits reversed1001010010011000100010111111011000101000000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000010100011011111101000100011001001010010at 64 bits, wrapping
Shifted left by 110100011011111101000100011001001010010= 175,550,640,722, no wrap
Shifted right by 1101000110111111010001000110010010100= 43,887,660,180, discarding the low bit
These bits as a double4.33667703 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
87,775,320,361 to the power 27,704,506,864,476,181,170,321
87,775,320,361 to the power 3676,265,558,252,920,412,678,801,680,205,881
87,775,320,361 to the power 4593594260247605966867181436736… (44 digits)
87,775,320,361 to the power 5521029263576844209250620021466… (55 digits)
First ten multiples87,775,320,361, 175,550,640,722, 263,325,961,083, 351,101,281,444, 438,876,601,805, 526,651,922,166, 614,427,242,527, 702,202,562,888, 789,977,883,249, 877,753,203,610
Powers of twoBetween 2^36 (68,719,476,736) and 2^37 (137,438,953,472)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1215the total stopping time
Highest value reached999,815,758,50411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps87,775,320,361 → 263,325,961,084 → 131,662,980,542 → 65,831,490,271 → 197,494,470,814 → 98,747,235,407 → 296,241,706,222 → 148,120,853,111 → 444,362,559,334 → 222,181,279,667 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,777,532,036,100%
87,775,320,361% as a decimal877,753,203.61
87,775,320,361% of 10087,775,320,361
87,775,320,361% of 1,000877,753,203,610
As a fraction of 10087,775,320,361/100
Read another way
As seconds2,781 years, 157 days and 19 hours
As bytes81.747 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 87,775,320,361
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page