Recognised as Number

55,237

Positive
Odd
Composite
5 digits

55,237 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,237

Digit count5

Digit sum22

Digit product1,050

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 13 × 607

Distinct prime factors37, 13, 607

Number of divisors8

Sum of divisors σ(n)68,096

Aliquot sum12,859sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)43,632integers below n that share no factor with it

Carmichael function λ(n)1,212the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 43,632

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 13, 91, 607, 4,249, 7,891, 55,2378 in total

Arithmetic

Previous number55,236

Next number55,238

Double110,474

Half27,618.5

Square3,051,126,169

Cube168,535,056,197,053

Square root235.025530528≈irrational, shown to 9 decimal places

Cube root38.084070561≈

Negation-55,237

Reciprocal0.0000181038≈

Representations

Decimal55,237

Binary110101111100010116 bits

Octal153705

HexadecimalD7C5

Base 3616MD

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

In wordsfifty-five thousand, two hundred and thirty-seven

Ordinalfifty-five thousand, two hundred and thirty-seventh

Scientific notation5.5237 × 10^4

Engineering notation55.237 × 10^3

In other bases

Ternary2210202211base 3; the most digit-efficient integer base after e: 10 digits

Quinary3231422base 5; one hand: 7 digits

Septenary320020base 7: 6 digits

Nonary83684base 9; each digit is two ternary digits: 5 digits

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

Vigesimal6i1hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal15:20:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101011111000101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2d7 c5

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

At each machine width

16-bit1101011111000101

32-bit00000000000000001101011111000101

64-bit0000000000000000000000000000000000000000000000001101011111000101

One's complement0010100000111010at 16 bits, every bit flipped

Bits reversed1010001111101011at 16 bits

Rotated left by 11010111110001011at 16 bits, wrapping

Shifted left by 111010111110001010= 110,474, no wrap

Shifted right by 1110101111100010= 27,618, discarding the low bit

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

Nearest landmarks

Next prime55,243+6

Previous prime55,229−8

Distance to nearest prime6

Nearest square below55,225

Nearest square above55,696

Powers & multiples

55,237 to the power 23,051,126,169

55,237 to the power 3168,535,056,197,053

55,237 to the power 49,309,370,899,156,616,561

55,237 to the power 5514,221,720,356,714,028,979,957

First ten multiples55,237, 110,474, 165,711, 220,948, 276,185, 331,422, 386,659, 441,896, 497,133, 552,370

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 147the total stopping time

Highest value reached165,7123× the starting value

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

First steps55,237 → 165,712 → 82,856 → 41,428 → 20,714 → 10,357 → 31,072 → 15,536 → 7,768 → 3,884 → …

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

As a percentage & fraction

As a percentage5,523,700%

55,237% as a decimal552.37

55,237% of 10055,237

55,237% of 1,000552,370

As a fraction of 10055,237/100

Read another way

As seconds15 hours, 20 minutes and 37 seconds

As bytes53.942 KiB

As a 24-bit colour#00D7C5

Keep nerding

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