Nerdulator> put something in

Recognised as Number

49,747

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value49,747
Digit count5
Digit sum31
Digit product7,056
Multiplicative persistence2times 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 factorisation49,747
Distinct prime factors149,747
Number of divisors2
Sum of divisors σ(n)49,748
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)49,746integers below n that share no factor with it
Carmichael function λ(n)49,746the 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,7472 in total

Arithmetic

Previous number49,746
Next number49,748
Double99,494
Square root223.040355093≈irrational, shown to 9 decimal places
Cube root36.778072555≈
Negation-49,747
Reciprocal0.0000201017≈

Representations

Decimal49,747
Binary110000100101001116 bits
Octal141123
HexadecimalC253
Base 3612DV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand, seven hundred and forty-seven
Ordinalforty-nine thousand, seven hundred and forty-seventh
Scientific notation4.9747 × 10^4
Engineering notation49.747 × 10^3

In other bases

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

Bit-level

1100001001010011
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 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
Bytes2c2 53
Gray code1010001101111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100001001010011
32-bit00000000000000001100001001010011
64-bit0000000000000000000000000000000000000000000000001100001001010011
One's complement0011110110101100at 16 bits, every bit flipped
Bits reversed1100101001000011at 16 bits
Rotated left by 11000010010100111at 16 bits, wrapping
Shifted left by 111000010010100110= 99,494, no wrap
Shifted right by 1110000100101001= 24,873, discarding the low bit
These bits as a double2.45782837 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,757+10
Previous prime49,741−6
Distance to nearest prime0, it is prime
Nearest square below49,729
Nearest square above50,176

Powers & multiples

49,747 to the power 22,474,764,009
49,747 to the power 3123,112,085,155,723
49,747 to the power 46,124,456,900,241,752,081
49,747 to the power 5304,673,357,416,326,440,773,507
First ten multiples49,747, 99,494, 149,241, 198,988, 248,735, 298,482, 348,229, 397,976, 447,723, 497,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47

Collatz (3n + 1) trajectory

Steps to reach 196the total stopping time
Highest value reached283,3365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,747 → 149,242 → 74,621 → 223,864 → 111,932 → 55,966 → 27,983 → 83,950 → 41,975 → 125,926 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,974,700%
49,747% as a decimal497.47
49,747% of 10049,747
49,747% of 1,000497,470
As a fraction of 10049,747/100

Read another way

As bytes48.581 KiB
As a 24-bit colour#00C253

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