Recognised as Number
55,182,491,982,338
- Positive
- Even
- Composite
- 14 digits
55,182,491,982,338 is an even 14-digit integer and a composite number. It has 54 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,182,491,982,338
Digit count14
Digit sum68
Digit product149,299,200
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7^2 × 107^2 × 7,013^2
Distinct prime factors42, 7, 107, 7,013
Number of divisors54
Sum of divisors σ(n)97,209,975,336,201
Aliquot sum42,027,483,353,863sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)23,425,274,012,784integers below n that share no factor with it
Carmichael function λ(n)5,856,318,503,196the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,425,274,012,784
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 14, 49, 98, 107, 214, 749, 1,498, 5,243, 7,013, 10,486, 11,449, 14,026, 22,898, 49,091, 80,143, 98,182, 160,286, 343,637, 561,001, 687,274, 750,391, 1,122,002, 1,500,782, 5,252,737, 10,505,474, 36,769,159, 49,182,169, 73,538,318, 80,291,837, 98,364,338, 160,583,674, 344,275,183, 562,042,859, 688,550,366, 1,124,085,718, 2,409,926,281, 3,934,300,013, 4,819,852,562, 5,262,492,083, 7,868,600,026, 10,524,984,166, 36,837,444,581, 73,674,889,162, 257,862,112,067, 515,724,224,134, 563,086,652,881, 1,126,173,305,762, 3,941,606,570,167, 7,883,213,140,334, 27,591,245,991,169, 55,182,491,982,33854 in total
Arithmetic
Previous number55,182,491,982,337
Next number55,182,491,982,339
Double110,364,983,964,676
Square3,045,107,421,380,797,652,903,946,244
Cube168,036,615,865,703,808,158,563,142,232,370,549,438,472
Square root7,428,491.90497896≈irrational, shown to 9 decimal places
Cube root38,071.539284193≈
Negation-55,182,491,982,338
Reciprocal1.81216898 × 10^-14≈
Representations
Decimal55,182,491,982,338
Binary110010001100000010110011010101000110100000001046 bits
Octal1443005465215002
Hexadecimal32302CD51A02
Base 36JK6HIYFPE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five trillion, one hundred and eighty-two billion, four hundred and ninety-one million, nine hundred and eighty-two thousand, three hundred and thirty-eight
Ordinalfifty-five trillion, one hundred and eighty-two billion, four hundred and ninety-one million, nine hundred and eighty-two thousand, three hundred and thirty-eighth
Scientific notation5.5182492 × 10^13
Engineering notation55.182492 × 10^12
In other bases
Ternary21020101101122202010121220212base 3; the most digit-efficient integer base after e: 29 digits
Quinary24213102220421413323base 5; one hand: 20 digits
Septenary14423542410430100base 7: 17 digits
Nonary236341582117825base 9; each digit is two ternary digits: 15 digits
Duodecimal62328a0ab5942base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal57fb68ehfgibase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal19:42:45:8:19:55:5:38base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T11T010111TT00T1T011T0T0T10TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100111000001111101110101010110111000000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000001100100011000000101100110101010001101000000010
Bit length46 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits29within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being even
Highest set bitbit 45worth 35,184,372,088,832
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes632 30 2c d5 1a 02
Gray code1010110010100000111010101111111001011100000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000001100100011000000101100110101010001101000000010
One's complement1111111111111111110011011100111111010011001010101110010111111101at 64 bits, every bit flipped
Bits reversed0100000001011000101010110011010000001100010011000000000000000000at 64 bits
Rotated left by 10000000000000000011001000110000001011001101010100011010000000100at 64 bits, wrapping
Shifted left by 111001000110000001011001101010100011010000000100= 110,364,983,964,676, no wrap
Shifted right by 1110010001100000010110011010101000110100000001= 27,591,245,991,169, discarding the low bit
These bits as a double2.72637735 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime3
Nearest square below55,182,478,537,081
Nearest square above55,182,493,394,064
Powers & multiples
55,182,491,982,338 to the power 23,045,107,421,380,797,652,903,946,244
55,182,491,982,338 to the power 3168036615865703808158563142232… (42 digits)
55,182,491,982,338 to the power 4927267920774841075865938466803… (55 digits)
55,182,491,982,338 to the power 5511689546036368954535182994349… (69 digits)
First ten multiples55,182,491,982,338, 110,364,983,964,676, 165,547,475,947,014, 220,729,967,929,352, 275,912,459,911,690, 331,094,951,894,028, 386,277,443,876,366, 441,459,935,858,704, 496,642,427,841,042, 551,824,919,823,380
Powers of twoBetween 2^45 (35,184,372,088,832) and 2^46 (70,368,744,177,664)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1170the total stopping time
Highest value reached82,773,737,973,5081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,182,491,982,338 → 27,591,245,991,169 → 82,773,737,973,508 → 41,386,868,986,754 → 20,693,434,493,377 → 62,080,303,480,132 → 31,040,151,740,066 → 15,520,075,870,033 → 46,560,227,610,100 → 23,280,113,805,050 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5.5182492 × 10^15%
55,182,491,982,338% as a decimal551,824,919,823.38
55,182,491,982,338% of 10055,182,491,982,338
55,182,491,982,338% of 1,000551,824,919,823,380
As a fraction of 10055,182,491,982,338/100
Read another way
As seconds1,748,627 years, 238 days and 1 hour
As bytes50.188 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 55,182,491,982,338
Nearby primes
Also reads as
55182491982338 (identifier)
- 14 characters
- Checksum valid
55182491982338 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). The check digit is valid for GTIN-14 (case/carton). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-14 (case/carton)Check digit validGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page