Nerdulator> put something in

Recognised as Number

55,595

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value55,595
Digit count5
Digit sum29
Digit product5,625
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 11,119
Distinct prime factors25, 11,119
Number of divisors4
Sum of divisors σ(n)66,720
Aliquot sum11,125sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)44,472integers below n that share no factor with it
Carmichael function λ(n)22,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,472
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 11,119, 55,5954 in total

Arithmetic

Previous number55,594
Next number55,596
Double111,190
Square root235.785919851≈irrational, shown to 9 decimal places
Cube root38.166169806≈
Negation-55,595
Reciprocal0.0000179872≈

Representations

Decimal55,595
Binary110110010010101116 bits
Octal154453
HexadecimalD92B
Base 3616WB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-five thousand, five hundred and ninety-five
Ordinalfifty-five thousand, five hundred and ninety-fifth
Scientific notation5.5595 × 10^4
Engineering notation55.595 × 10^3

In other bases

Ternary2211021002base 3; the most digit-efficient integer base after e: 10 digits
Quinary3234340base 5; one hand: 7 digits
Septenary321041base 7: 6 digits
Nonary84232base 9; each digit is two ternary digits: 5 digits
Duodecimal2820bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal6ijfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:26:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10T111T101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100101111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101100100101011
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
Bytes2d9 2b
Gray code1011010110111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101100100101011
32-bit00000000000000001101100100101011
64-bit0000000000000000000000000000000000000000000000001101100100101011
One's complement0010011011010100at 16 bits, every bit flipped
Bits reversed1101010010011011at 16 bits
Rotated left by 11011001001010111at 16 bits, wrapping
Shifted left by 111011001001010110= 111,190, no wrap
Shifted right by 1110110010010101= 27,797, discarding the low bit
These bits as a double2.74675796 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime55,603+8
Previous prime55,589−6
Distance to nearest prime6
Nearest square below55,225
Nearest square above55,696

Powers & multiples

55,595 to the power 23,090,804,025
55,595 to the power 3171,833,249,769,875
55,595 to the power 49,553,069,520,956,200,625
55,595 to the power 5531,102,900,017,559,973,746,875
First ten multiples55,595, 111,190, 166,785, 222,380, 277,975, 333,570, 389,165, 444,760, 500,355, 555,950
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1140the total stopping time
Highest value reached250,1804× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps55,595 → 166,786 → 83,393 → 250,180 → 125,090 → 62,545 → 187,636 → 93,818 → 46,909 → 140,728 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,559,500%
55,595% as a decimal555.95
55,595% of 10055,595
55,595% of 1,000555,950
As a fraction of 10055,595/100

Read another way

As bytes54.292 KiB
As a 24-bit colour#00D92B

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