Nerdulator> put something in

Recognised as Number

55,359

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value55,359
Digit count5
Digit sum27
Digit product3,375
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 6,151
Distinct prime factors23, 6,151
Number of divisors6
Sum of divisors σ(n)79,976
Aliquot sum24,617sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,900integers below n that share no factor with it
Carmichael function λ(n)6,150the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 36,900
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 6,151, 18,453, 55,3596 in total

Arithmetic

Previous number55,358
Next number55,360
Double110,718
Square root235.284933644≈irrational, shown to 9 decimal places
Cube root38.112088255≈
Negation-55,359
Reciprocal0.0000180639≈

Representations

Decimal55,359
Binary110110000011111116 bits
Octal154077
HexadecimalD83F
Base 3616PR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, three hundred and fifty-nine
Ordinalfifty-five thousand, three hundred and fifty-ninth
Scientific notation5.5359 × 10^4
Engineering notation55.359 × 10^3

In other bases

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

Bit-level

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

At each machine width

16-bit1101100000111111
32-bit00000000000000001101100000111111
64-bit0000000000000000000000000000000000000000000000001101100000111111
One's complement0010011111000000at 16 bits, every bit flipped
Bits reversed1111110000011011at 16 bits
Rotated left by 11011000001111111at 16 bits, wrapping
Shifted left by 111011000001111110= 110,718, no wrap
Shifted right by 1110110000011111= 27,679, discarding the low bit
These bits as a double2.73509801 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,373+14
Previous prime55,351−8
Distance to nearest prime8
Nearest square below55,225
Nearest square above55,696

Powers & multiples

55,359 to the power 23,064,618,881
55,359 to the power 3169,654,236,633,279
55,359 to the power 49,391,888,885,781,692,161
55,359 to the power 5519,925,576,827,988,696,340,799
First ten multiples55,359, 110,718, 166,077, 221,436, 276,795, 332,154, 387,513, 442,872, 498,231, 553,590
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time
Highest value reached1,261,16822× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,359 → 166,078 → 83,039 → 249,118 → 124,559 → 373,678 → 186,839 → 560,518 → 280,259 → 840,778 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,535,900%
55,359% as a decimal553.59
55,359% of 10055,359
55,359% of 1,000553,590
As a fraction of 10055,359/100

Read another way

As bytes54.062 KiB
As a 24-bit colour#00D83F

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 “55359” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.