Recognised as Number
55,038
- Positive
- Even
- Composite
- 5 digits
55,038 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value55,038
Digit count5
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 9,173
Distinct prime factors32, 3, 9,173
Number of divisors8
Sum of divisors σ(n)110,088
Aliquot sum55,050sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)18,344integers below n that share no factor with it
Carmichael function λ(n)9,172the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,344
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 9,173, 18,346, 27,519, 55,0388 in total
Arithmetic
Representations
Decimal55,038
Binary110101101111111016 bits
Octal153376
HexadecimalD6FE
Base 3616GU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand and thirty-eight
Ordinalfifty-five thousand and thirty-eighth
Scientific notation5.5038 × 10^4
Engineering notation55.038 × 10^3
In other bases
Ternary2210111110base 3; the most digit-efficient integer base after e: 10 digits
Quinary3230123base 5; one hand: 7 digits
Septenary316314base 7: 6 digits
Nonary83443base 9; each digit is two ternary digits: 5 digits
Duodecimal27a26base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6hbibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:17:18base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T10111110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101100000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101011011111110
Bit length16 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits4within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2d6 fe
Gray code1011110110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101011011111110
32-bit00000000000000001101011011111110
64-bit0000000000000000000000000000000000000000000000001101011011111110
One's complement0010100100000001at 16 bits, every bit flipped
Bits reversed0111111101101011at 16 bits
Rotated left by 11010110111111101at 16 bits, wrapping
Shifted left by 111010110111111100= 110,076, no wrap
Shifted right by 1110101101111111= 27,519, discarding the low bit
These bits as a double2.7192385 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
55,038 to the power 23,029,181,444
55,038 to the power 3166,720,088,314,872
55,038 to the power 49,175,940,220,673,925,136
55,038 to the power 5505,025,397,865,451,491,635,168
First ten multiples55,038, 110,076, 165,114, 220,152, 275,190, 330,228, 385,266, 440,304, 495,342, 550,380
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached1,357,28824× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,038 → 27,519 → 82,558 → 41,279 → 123,838 → 61,919 → 185,758 → 92,879 → 278,638 → 139,319 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage5,503,800%
55,038% as a decimal550.38
55,038% of 10055,038
55,038% of 1,000550,380
As a fraction of 10055,038/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 55,038
Nerdulate something else
Nothing in mind? Surprise me · today’s page