Nerdulator> put something in

Recognised as Number

55,357

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value55,357
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 factorisation197 × 281
Distinct prime factors2197, 281
Number of divisors4
Sum of divisors σ(n)55,836
Aliquot sum479sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)54,880integers below n that share no factor with it
Carmichael function λ(n)1,960the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 54,880
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 197, 281, 55,3574 in total

Arithmetic

Previous number55,356
Next number55,358
Double110,714
Square root235.28068344≈irrational, shown to 9 decimal places
Cube root38.111629281≈
Negation-55,357
Reciprocal0.0000180646≈

Representations

Decimal55,357
Binary110110000011110116 bits
Octal154075
HexadecimalD83D
Base 3616PP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, three hundred and fifty-seven
Ordinalfifty-five thousand, three hundred and fifty-seventh
Scientific notation5.5357 × 10^4
Engineering notation55.357 × 10^3

In other bases

Ternary2210221021base 3; the most digit-efficient integer base after e: 10 digits
Quinary3232412base 5; one hand: 7 digits
Septenary320251base 7: 6 digits
Nonary83837base 9; each digit is two ternary digits: 5 digits
Duodecimal28051base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6i7hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:22:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T110T11T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100001001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101100000111101
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
Bytes2d8 3d
Gray code1011010000100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101100000111101
32-bit00000000000000001101100000111101
64-bit0000000000000000000000000000000000000000000000001101100000111101
One's complement0010011111000010at 16 bits, every bit flipped
Bits reversed1011110000011011at 16 bits
Rotated left by 11011000001111011at 16 bits, wrapping
Shifted left by 111011000001111010= 110,714, no wrap
Shifted right by 1110110000011110= 27,678, discarding the low bit
These bits as a double2.7349992 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,373+16
Previous prime55,351−6
Distance to nearest prime6
Nearest square below55,225
Nearest square above55,696

Powers & multiples

55,357 to the power 23,064,397,449
55,357 to the power 3169,635,849,584,293
55,357 to the power 49,390,531,725,437,707,601
55,357 to the power 5519,831,664,725,055,179,668,557
First ten multiples55,357, 110,714, 166,071, 221,428, 276,785, 332,142, 387,499, 442,856, 498,213, 553,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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1228the total stopping time
Highest value reached250,5044× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,357 → 166,072 → 83,036 → 41,518 → 20,759 → 62,278 → 31,139 → 93,418 → 46,709 → 140,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,535,700%
55,357% as a decimal553.57
55,357% of 10055,357
55,357% of 1,000553,570
As a fraction of 10055,357/100

Read another way

As bytes54.06 KiB
As a 24-bit colour#00D83D

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “55357” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.