Recognised as Number
55,980,033,223
- Positive
- Odd
- Prime
- 11 digits
55,980,033,223 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value55,980,033,223
Digit count11
Digit sum40
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
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation55,980,033,223
Distinct prime factors155,980,033,223
Number of divisors2
Sum of divisors σ(n)55,980,033,224
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)55,980,033,222integers below n that share no factor with it
Carmichael function λ(n)55,980,033,222the 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,2232 in total
Arithmetic
Previous number55,980,033,222
Next number55,980,033,224
Double111,960,066,446
Half27,990,016,611.5
Square3,133,764,119,648,183,767,729
Cube175,428,219,530,950,674,389,078,735,260,567
Square root236,601.000046492≈irrational, shown to 9 decimal places
Cube root3,825.407608274≈
Negation-55,980,033,223
Reciprocal1.78635121 × 10^-11≈
Representations
Decimal55,980,033,223
Binary11010000100010101011100001001100011136 bits
Octal641052702307
HexadecimalD08AB84C7
Base 36PPT2E2V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five billion, nine hundred and eighty million, thirty-three thousand, two hundred and twenty-three
Ordinalfifty-five billion, nine hundred and eighty million, thirty-three thousand, two hundred and twenty-third
Scientific notation5.59800332 × 10^10
Engineering notation55.980033 × 10^9
In other bases
Ternary12100111100022100000211base 3; the most digit-efficient integer base after e: 23 digits
Quinary1404121342030343base 5; one hand: 16 digits
Septenary4021144300642base 7: 13 digits
Nonary170440270024base 9; each digit is two ternary digits: 12 digits
Duodecimalaa23724687base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal23edf4313base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal1:11:59:26:49:13:43base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1TT10011110010T100001T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110100011001111111001000010111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000000110100001000101010111000010011000111
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 c7
Gray code101110001100111111100100011010100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000000110100001000101010111000010011000111
One's complement1111111111111111111111111111001011110111010101000111101100111000at 64 bits, every bit flipped
Bits reversed1110001100100001110101010001000010110000000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000001101000010001010101110000100110001110at 64 bits, wrapping
Shifted left by 11101000010001010101110000100110001110= 111,960,066,446, no wrap
Shifted right by 111010000100010101011100001001100011= 27,990,016,611, discarding the low bit
These bits as a double2.76578113 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime0, it is prime
Nearest square below55,980,033,201
Nearest square above55,980,506,404
Powers & multiples
55,980,033,223 to the power 23,133,764,119,648,183,767,729
55,980,033,223 to the power 3175,428,219,530,950,674,389,078,735,260,567
55,980,033,223 to the power 4982047755759435622907488282824… (43 digits)
55,980,033,223 to the power 5549750659939857957660908939280… (54 digits)
First ten multiples55,980,033,223, 111,960,066,446, 167,940,099,669, 223,920,132,892, 279,900,166,115, 335,880,199,338, 391,860,232,561, 447,840,265,784, 503,820,299,007, 559,800,332,230
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1372the total stopping time
Highest value reached377,865,224,2606× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,980,033,223 → 167,940,099,670 → 83,970,049,835 → 251,910,149,506 → 125,955,074,753 → 377,865,224,260 → 188,932,612,130 → 94,466,306,065 → 283,398,918,196 → 141,699,459,098 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,598,003,322,300%
55,980,033,223% as a decimal559,800,332.23
55,980,033,223% of 10055,980,033,223
55,980,033,223% of 1,000559,800,332,230
As a fraction of 10055,980,033,223/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.
Neighbouring numbers
Derived from 55,980,033,223
Nearby primes
Nerdulate something else
Nothing in mind? Surprise me · today’s page