Recognised as Number

55,980,033,181

Positive
Odd
Prime
11 digits

55,980,033,181 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value55,980,033,181

Digit count11

Digit sum43

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation55,980,033,181

Distinct prime factors155,980,033,181

Number of divisors2

Sum of divisors σ(n)55,980,033,182

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)55,980,033,180integers below n that share no factor with it

Carmichael function λ(n)55,980,033,180the 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, 55,980,033,1812 in total

Arithmetic

Previous number55,980,033,180

Next number55,980,033,182

Double111,960,066,362

Half27,990,016,590.5

Square3,133,764,114,945,860,978,761

Cube175,428,219,136,096,395,609,653,916,268,741

Square root236,600.999957735≈irrational, shown to 9 decimal places

Cube root3,825.407607318≈

Negation-55,980,033,181

Reciprocal1.78635121 × 10^-11≈

Representations

Decimal55,980,033,181

Binary11010000100010101011100001001001110136 bits

Octal641052702235

HexadecimalD08AB849D

Base 36PPT2E1P

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

In wordsfifty-five billion, nine hundred and eighty million, thirty-three thousand, one hundred and eighty-one

Ordinalfifty-five billion, nine hundred and eighty million, thirty-three thousand, one hundred and eighty-first

Scientific notation5.59800332 × 10^10

Engineering notation55.980033 × 10^9

In other bases

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

Quinary1404121342030211base 5; one hand: 16 digits

Septenary4021144300552base 7: 13 digits

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

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

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

Sexagesimal1:11:59:26:49:13:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000000000110100001000101010111000010010011101

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 08 ab 84 9d

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

At each machine width

64-bit0000000000000000000000000000110100001000101010111000010010011101

One's complement1111111111111111111111111111001011110111010101000111101101100010at 64 bits, every bit flipped

Bits reversed1011100100100001110101010001000010110000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000001101000010001010101110000100100111010at 64 bits, wrapping

Shifted left by 11101000010001010101110000100100111010= 111,960,066,362, no wrap

Shifted right by 111010000100010101011100001001001110= 27,990,016,590, discarding the low bit

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

Nearest landmarks

Next prime55,980,033,223+42

Previous prime55,980,033,157−24

Distance to nearest prime0, it is prime

Nearest square below55,979,560,000

Nearest square above55,980,033,201

Powers & multiples

55,980,033,181 to the power 23,133,764,114,945,860,978,761

55,980,033,181 to the power 3175,428,219,136,096,395,609,653,916,268,741

55,980,033,181 to the power 4982047752812241538104292895665… (43 digits)

55,980,033,181 to the power 5549750657877557673660647921378… (54 digits)

First ten multiples55,980,033,181, 111,960,066,362, 167,940,099,543, 223,920,132,724, 279,900,165,905, 335,880,199,086, 391,860,232,267, 447,840,265,448, 503,820,298,629, 559,800,331,810

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1434the total stopping time

Highest value reached167,940,099,5443× the starting value

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

First steps55,980,033,181 → 167,940,099,544 → 83,970,049,772 → 41,985,024,886 → 20,992,512,443 → 62,977,537,330 → 31,488,768,665 → 94,466,305,996 → 47,233,152,998 → 23,616,576,499 → …

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

As a percentage & fraction

As a percentage5,598,003,318,100%

55,980,033,181% as a decimal559,800,331.81

55,980,033,181% of 10055,980,033,181

55,980,033,181% of 1,000559,800,331,810

As a fraction of 10055,980,033,181/100

Read another way

As seconds1,773 years, 328 days and 19 hours

As bytes52.135 GiB

Keep nerding

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