Nerdulator> put something in

Recognised as Number

49,559

  • Positive
  • Odd
  • Prime
  • 5 digits

49,559 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value49,559
Digit count5
Digit sum32
Digit product8,100
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation49,559
Distinct prime factors149,559
Number of divisors2
Sum of divisors σ(n)49,560
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)49,558integers below n that share no factor with it
Carmichael function λ(n)49,558the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 49,5592 in total

Arithmetic

Previous number49,558
Next number49,560
Double99,118
Square root222.618507766≈irrational, shown to 9 decimal places
Cube root36.731684458≈
Negation-49,559
Reciprocal0.000020178≈

Representations

Decimal49,559
Binary110000011001011116 bits
Octal140627
HexadecimalC197
Base 36128N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand, five hundred and fifty-nine
Ordinalforty-nine thousand, five hundred and fifty-ninth
Scientific notation4.9559 × 10^4
Engineering notation49.559 × 10^3

In other bases

Ternary2111222112base 3; the most digit-efficient integer base after e: 10 digits
Quinary3041214base 5; one hand: 7 digits
Septenary264326base 7: 6 digits
Nonary74875base 9; each digit is two ternary digits: 5 digits
Duodecimal2481bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal63hjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:45:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TTT000TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011011101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100000110010111
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 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
Bytes2c1 97
Gray code1010000101011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100000110010111
32-bit00000000000000001100000110010111
64-bit0000000000000000000000000000000000000000000000001100000110010111
One's complement0011111001101000at 16 bits, every bit flipped
Bits reversed1110100110000011at 16 bits
Rotated left by 11000001100101111at 16 bits, wrapping
Shifted left by 111000001100101110= 99,118, no wrap
Shifted right by 1110000011001011= 24,779, discarding the low bit
These bits as a double2.44853993 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,597+38
Previous prime49,549−10
Distance to nearest prime0, it is prime
Nearest square below49,284
Nearest square above49,729

Powers & multiples

49,559 to the power 22,456,094,481
49,559 to the power 3121,721,586,383,879
49,559 to the power 46,032,400,099,598,659,361
49,559 to the power 5298,959,716,536,009,959,271,799
First ten multiples49,559, 99,118, 148,677, 198,236, 247,795, 297,354, 346,913, 396,472, 446,031, 495,590
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 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 165the total stopping time
Highest value reached334,5286× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,559 → 148,678 → 74,339 → 223,018 → 111,509 → 334,528 → 167,264 → 83,632 → 41,816 → 20,908 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,955,900%
49,559% as a decimal495.59
49,559% of 10049,559
49,559% of 1,000495,590
As a fraction of 10049,559/100

Read another way

As bytes48.397 KiB
As a 24-bit colour#00C197

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