Recognised as Number

55,734

Positive
Even
Composite
5 digits

55,734 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value55,734

Digit count5

Digit sum24

Digit product2,100

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 7 × 1,327

Distinct prime factors42, 3, 7, 1,327

Number of divisors16

Sum of divisors σ(n)127,488

Aliquot sum71,754sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)1,326the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,912

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 7, 14, 21, 42, 1,327, 2,654, 3,981, 7,962, 9,289, 18,578, 27,867, 55,73416 in total

Arithmetic

Previous number55,733

Next number55,735

Double111,468

Half27,867

Square3,106,278,756

Cube173,125,340,186,904

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

Cube root38.197951335≈

Negation-55,734

Reciprocal0.0000179424≈

Representations

Decimal55,734

Binary110110011011011016 bits

Octal154666

HexadecimalD9B6

Base 361706

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

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

Ordinalfifty-five thousand, seven hundred and thirty-fourth

Scientific notation5.5734 × 10^4

Engineering notation55.734 × 10^3

In other bases

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

Quinary3240414base 5; one hand: 7 digits

Septenary321330base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101100110110110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2d9 b6

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

At each machine width

16-bit1101100110110110

32-bit00000000000000001101100110110110

64-bit0000000000000000000000000000000000000000000000001101100110110110

One's complement0010011001001001at 16 bits, every bit flipped

Bits reversed0110110110011011at 16 bits

Rotated left by 11011001101101101at 16 bits, wrapping

Shifted left by 111011001101101100= 111,468, no wrap

Shifted right by 1110110011011011= 27,867, discarding the low bit

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

Nearest landmarks

Next prime55,763+29

Previous prime55,733−1

Distance to nearest prime1

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,734 to the power 23,106,278,756

55,734 to the power 3173,125,340,186,904

55,734 to the power 49,648,967,709,976,907,536

55,734 to the power 5537,775,566,347,852,964,611,424

First ten multiples55,734, 111,468, 167,202, 222,936, 278,670, 334,404, 390,138, 445,872, 501,606, 557,340

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 4

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 8

Divisible by 12No, remainder 6

Divisible by 100No, remainder 34

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time

Highest value reached211,6243× the starting value

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

First steps55,734 → 27,867 → 83,602 → 41,801 → 125,404 → 62,702 → 31,351 → 94,054 → 47,027 → 141,082 → …

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

As a percentage & fraction

As a percentage5,573,400%

55,734% as a decimal557.34

55,734% of 10055,734

55,734% of 1,000557,340

As a fraction of 10055,734/100

Read another way

As seconds15 hours, 28 minutes and 54 seconds

As bytes54.428 KiB

As a 24-bit colour#00D9B6

Keep nerding

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