Recognised as Number

55,733

Positive
Odd
Prime
5 digits

55,733 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value55,733

Digit count5

Digit sum23

Digit product1,575

Multiplicative persistence5times 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 factorisation55,733

Distinct prime factors155,733

Number of divisors2

Sum of divisors σ(n)55,734

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)55,732the 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,7332 in total

Arithmetic

Previous number55,732

Next number55,734

Double111,466

Half27,866.5

Square3,106,167,289

Cube173,116,021,517,837

Square root236.078376816≈irrational, shown to 9 decimal places

Cube root38.19772288≈

Negation-55,733

Reciprocal0.0000179427≈

Representations

Decimal55,733

Binary110110011011010116 bits

Octal154665

HexadecimalD9B5

Base 361705

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

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

Ordinalfifty-five thousand, seven hundred and thirty-third

Scientific notation5.5733 × 10^4

Engineering notation55.733 × 10^3

In other bases

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

Quinary3240413base 5; one hand: 7 digits

Septenary321326base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101100110110101

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

Bytes2d9 b5

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

At each machine width

16-bit1101100110110101

32-bit00000000000000001101100110110101

64-bit0000000000000000000000000000000000000000000000001101100110110101

One's complement0010011001001010at 16 bits, every bit flipped

Bits reversed1010110110011011at 16 bits

Rotated left by 11011001101101011at 16 bits, wrapping

Shifted left by 111011001101101010= 111,466, no wrap

Shifted right by 1110110011011010= 27,866, discarding the low bit

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

Nearest landmarks

Next prime55,763+30

Previous prime55,721−12

Distance to nearest prime0, it is prime

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,733 to the power 23,106,167,289

55,733 to the power 3173,116,021,517,837

55,733 to the power 49,648,275,227,253,609,521

55,733 to the power 5537,727,323,240,525,419,433,893

First ten multiples55,733, 111,466, 167,199, 222,932, 278,665, 334,398, 390,131, 445,864, 501,597, 557,330

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached167,2003× the starting value

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

First steps55,733 → 167,200 → 83,600 → 41,800 → 20,900 → 10,450 → 5,225 → 15,676 → 7,838 → 3,919 → …

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

As a percentage & fraction

As a percentage5,573,300%

55,733% as a decimal557.33

55,733% of 10055,733

55,733% of 1,000557,330

As a fraction of 10055,733/100

Read another way

As seconds15 hours, 28 minutes and 53 seconds

As bytes54.427 KiB

As a 24-bit colour#00D9B5

Keep nerding

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