Recognised as Number

57,016,051,200

Positive
Even
Composite
11 digits

57,016,051,200 is an even 11-digit integer and a composite number. It has 720 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value57,016,051,200

Digit count11

Digit sum27

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^9 × 3^3 × 5^2 × 19^2 × 457

Distinct prime factors52, 3, 5, 19, 457

Number of divisors720

Sum of divisors σ(n)221,354,202,960

Aliquot sum164,338,151,760sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)14,372,536,320integers below n that share no factor with it

Carmichael function λ(n)109,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 14,372,536,320

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors720 divisors, too many to listlisting is capped at 512

Arithmetic

Previous number57,016,051,199

Next number57,016,051,201

Double114,032,102,400

Half28,508,025,600

Square3,250,830,094,441,021,440,000

Cube185,349,495,107,150,113,803,337,728,000,000

Square root238,780.340899329≈irrational, shown to 9 decimal places

Cube root3,848.862343346≈

Negation-57,016,051,200

Reciprocal1.75389207 × 10^-11≈

Representations

Decimal57,016,051,200

Binary11010100011001101011111001100000000036 bits

Octal650632763000

HexadecimalD466BE600

Base 36Q6XVUO0

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

In wordsfifty-seven billion, sixteen million, fifty-one thousand, two hundred

Ordinalfifty-seven billion, sixteen million, fifty-one thousand, two hundredth

Scientific notation5.70160512 × 10^10

Engineering notation57.016051 × 10^9

In other bases

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

Quinary1413232102114300base 5; one hand: 16 digits

Septenary4055624303343base 7: 13 digits

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

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

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

Sexagesimal1:13:19:23:12:0:0base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000000000110101000110011010111110011000000000

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 even

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

Lowest set bitbit 99 trailing zeros

Power of twoNo

Bytes50d 46 6b e6 00

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

At each machine width

64-bit0000000000000000000000000000110101000110011010111110011000000000

One's complement1111111111111111111111111111001010111001100101000001100111111111at 64 bits, every bit flipped

Bits reversed0000000001100111110101100110001010110000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000001101010001100110101111100110000000000at 64 bits, wrapping

Shifted left by 11101010001100110101111100110000000000= 114,032,102,400, no wrap

Shifted right by 111010100011001101011111001100000000= 28,508,025,600, discarding the low bit

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

Nearest landmarks

Next prime57,016,051,201+1

Previous prime57,016,051,189−11

Distance to nearest prime1

Nearest square below57,015,888,400

Nearest square above57,016,365,961

Powers & multiples

57,016,051,200 to the power 23,250,830,094,441,021,440,000

57,016,051,200 to the power 3185,349,495,107,150,113,803,337,728,000,000

57,016,051,200 to the power 4105678963029234203746969306305… (44 digits)

57,016,051,200 to the power 5602539716683772445762843381313… (54 digits)

First ten multiples57,016,051,200, 114,032,102,400, 171,048,153,600, 228,064,204,800, 285,080,256,000, 342,096,307,200, 399,112,358,400, 456,128,409,600, 513,144,460,800, 570,160,512,000

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9Yes

Divisible by 10Yes

Divisible by 11No, remainder 9

Divisible by 12Yes

Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1217the total stopping time

Highest value reached57,016,051,200

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

First steps57,016,051,200 → 28,508,025,600 → 14,254,012,800 → 7,127,006,400 → 3,563,503,200 → 1,781,751,600 → 890,875,800 → 445,437,900 → 222,718,950 → 111,359,475 → …

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

As a percentage & fraction

As a percentage5,701,605,120,000%

57,016,051,200% as a decimal570,160,512

57,016,051,200% of 10057,016,051,200

57,016,051,200% of 1,000570,160,512,000

As a fraction of 10057,016,051,200/100

Read another way

As seconds1,806 years, 266 days and 12 hours

As bytes53.1 GiB

Keep nerding

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