Recognised as Number

57,788,440,579

Positive
Odd
Prime
11 digits

57,788,440,579 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value57,788,440,579

Digit count11

Digit sum64

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation57,788,440,579

Distinct prime factors157,788,440,579

Number of divisors2

Sum of divisors σ(n)57,788,440,580

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)57,788,440,578integers below n that share no factor with it

Carmichael function λ(n)57,788,440,578the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 57,788,440,5792 in total

Arithmetic

Previous number57,788,440,578

Next number57,788,440,580

Double115,576,881,158

Half28,894,220,289.5

Square3,339,503,864,552,613,855,241

Cube192,984,720,640,039,590,192,726,636,224,539

Square root240,392.263974946≈irrational, shown to 9 decimal places

Cube root3,866.164467438≈

Negation-57,788,440,579

Reciprocal1.73044988 × 10^-11≈

Representations

Decimal57,788,440,579

Binary11010111010001110101101000000000001136 bits

Octal656435320003

HexadecimalD7475A003

Base 36QJPQU4J

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfifty-seven billion, seven hundred and eighty-eight million, four hundred and forty thousand, five hundred and seventy-nine

Ordinalfifty-seven billion, seven hundred and eighty-eight million, four hundred and forty thousand, five hundred and seventy-ninth

Scientific notation5.77884406 × 10^10

Engineering notation57.788441 × 10^9

In other bases

Ternary12112011101010221120001base 3; the most digit-efficient integer base after e: 23 digits

Quinary1421322320044304base 5; one hand: 16 digits

Septenary4114023432412base 7: 13 digits

Nonary175141127501base 9; each digit is two ternary digits: 12 digits

Duodecimalb249294717base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits

Vigesimal252ihf18jbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits

Sexagesimal1:14:18:59:4:36:19base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

Balanced ternary1T0TTT01110101100TTT0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1001010110101100010101110000000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000000000000110101110100011101011010000000000011

Bit length36 bitsto write the magnitude

Set bits16the population count, or Hamming weight

Zero bits20within that length

Bit parityeven16 set bits, so even; not the same as the number itself being odd

Highest set bitbit 35worth 34,359,738,368

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes50d 74 75 a0 03

Gray code101111001110010011110111000000000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000000000000110101110100011101011010000000000011

One's complement1111111111111111111111111111001010001011100010100101111111111100at 64 bits, every bit flipped

Bits reversed1100000000000101101011100010111010110000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000001101011101000111010110100000000000110at 64 bits, wrapping

Shifted left by 11101011101000111010110100000000000110= 115,576,881,158, no wrap

Shifted right by 111010111010001110101101000000000001= 28,894,220,289, discarding the low bit

These bits as a double2.85512832 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime57,788,440,607+28

Previous prime57,788,440,553−26

Distance to nearest prime0, it is prime

Nearest square below57,788,313,664

Nearest square above57,788,794,449

Powers & multiples

57,788,440,579 to the power 23,339,503,864,552,613,855,241

57,788,440,579 to the power 3192,984,720,640,039,590,192,726,636,224,539

57,788,440,579 to the power 4111522860613618427060598943754… (44 digits)

57,788,440,579 to the power 5644473220377018795037086769330… (54 digits)

First ten multiples57,788,440,579, 115,576,881,158, 173,365,321,737, 231,153,762,316, 288,942,202,895, 346,730,643,474, 404,519,084,053, 462,307,524,632, 520,095,965,211, 577,884,405,790

Powers of twoBetween 2^35 (34,359,738,368) and 2^36 (68,719,476,736)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1204the total stopping time

Highest value reached260,047,982,6084× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps57,788,440,579 → 173,365,321,738 → 86,682,660,869 → 260,047,982,608 → 130,023,991,304 → 65,011,995,652 → 32,505,997,826 → 16,252,998,913 → 48,758,996,740 → 24,379,498,370 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,778,844,057,900%

57,788,440,579% as a decimal577,884,405.79

57,788,440,579% of 10057,788,440,579

57,788,440,579% of 1,000577,884,405,790

As a fraction of 10057,788,440,579/100

Read another way

As seconds1,831 years, 74 days and 22 hours

As bytes53.82 GiB

Keep nerding

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