Recognised as Number

55,957

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value55,957

Digit count5

Digit sum31

Digit product7,875

Multiplicative persistence3times 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 factorisation11 × 5,087

Distinct prime factors211, 5,087

Number of divisors4

Sum of divisors σ(n)61,056

Aliquot sum5,099sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)25,430the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 50,860

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 5,087, 55,9574 in total

Arithmetic

Previous number55,956

Next number55,958

Double111,914

Half27,978.5

Square3,131,185,849

Cube175,211,766,552,493

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

Cube root38.248828762≈

Negation-55,957

Reciprocal0.0000178709≈

Representations

Decimal55,957

Binary110110101001010116 bits

Octal155225

HexadecimalDA95

Base 36176D

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

In wordsfifty-five thousand, nine hundred and fifty-seven

Ordinalfifty-five thousand, nine hundred and fifty-seventh

Scientific notation5.5957 × 10^4

Engineering notation55.957 × 10^3

In other bases

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

Quinary3242312base 5; one hand: 7 digits

Septenary322066base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101101010010101

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes2da 95

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

At each machine width

16-bit1101101010010101

32-bit00000000000000001101101010010101

64-bit0000000000000000000000000000000000000000000000001101101010010101

One's complement0010010101101010at 16 bits, every bit flipped

Bits reversed1010100101011011at 16 bits

Rotated left by 11011010100101011at 16 bits, wrapping

Shifted left by 111011010100101010= 111,914, no wrap

Shifted right by 1110110101001010= 27,978, discarding the low bit

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

Nearest landmarks

Next prime55,967+10

Previous prime55,949−8

Distance to nearest prime8

Nearest square below55,696

Nearest square above56,169

Powers & multiples

55,957 to the power 23,131,185,849

55,957 to the power 3175,211,766,552,493

55,957 to the power 49,804,324,820,977,850,801

55,957 to the power 5548,620,604,007,457,597,271,557

First ten multiples55,957, 111,914, 167,871, 223,828, 279,785, 335,742, 391,699, 447,656, 503,613, 559,570

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 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1109the total stopping time

Highest value reached167,8723× the starting value

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

First steps55,957 → 167,872 → 83,936 → 41,968 → 20,984 → 10,492 → 5,246 → 2,623 → 7,870 → 3,935 → …

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

As a percentage & fraction

As a percentage5,595,700%

55,957% as a decimal559.57

55,957% of 10055,957

55,957% of 1,000559,570

As a fraction of 10055,957/100

Read another way

As seconds15 hours, 32 minutes and 37 seconds

As bytes54.646 KiB

As a 24-bit colour#00DA95

Keep nerding

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