Recognised as Number

55,735

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,735

Digit count5

Digit sum25

Digit product2,625

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 71 × 157

Distinct prime factors35, 71, 157

Number of divisors8

Sum of divisors σ(n)68,256

Aliquot sum12,521sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 71, 157, 355, 785, 11,147, 55,7358 in total

Arithmetic

Previous number55,734

Next number55,736

Double111,470

Half27,867.5

Square3,106,390,225

Cube173,134,659,190,375

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

Cube root38.198179788≈

Negation-55,735

Reciprocal0.000017942≈

Representations

Decimal55,735

Binary110110011011011116 bits

Octal154667

HexadecimalD9B7

Base 361707

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

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

Ordinalfifty-five thousand, seven hundred and thirty-fifth

Scientific notation5.5735 × 10^4

Engineering notation55.735 × 10^3

In other bases

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

Quinary3240420base 5; one hand: 7 digits

Septenary321331base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101100110110111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 set bits, so odd; 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 b7

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

At each machine width

16-bit1101100110110111

32-bit00000000000000001101100110110111

64-bit0000000000000000000000000000000000000000000000001101100110110111

One's complement0010011001001000at 16 bits, every bit flipped

Bits reversed1110110110011011at 16 bits

Rotated left by 11011001101101111at 16 bits, wrapping

Shifted left by 111011001101101110= 111,470, no wrap

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

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

Nearest landmarks

Next prime55,763+28

Previous prime55,733−2

Distance to nearest prime2

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,735 to the power 23,106,390,225

55,735 to the power 3173,134,659,190,375

55,735 to the power 49,649,660,229,975,550,625

55,735 to the power 5537,823,812,917,687,314,084,375

First ten multiples55,735, 111,470, 167,205, 222,940, 278,675, 334,410, 390,145, 445,880, 501,615, 557,350

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 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 7

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time

Highest value reached376,2166× the starting value

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

First steps55,735 → 167,206 → 83,603 → 250,810 → 125,405 → 376,216 → 188,108 → 94,054 → 47,027 → 141,082 → …

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

As a percentage & fraction

As a percentage5,573,500%

55,735% as a decimal557.35

55,735% of 10055,735

55,735% of 1,000557,350

As a fraction of 10055,735/100

Read another way

As seconds15 hours, 28 minutes and 55 seconds

As bytes54.429 KiB

As a 24-bit colour#00D9B7

Keep nerding

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