Nerdulator> put something in

Recognised as Number

49,176

  • Positive
  • Even
  • Composite
  • 5 digits

49,176 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value49,176
Digit count5
Digit sum27
Digit product1,512
Multiplicative persistence3times 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 factorisation2^3 × 3^2 × 683
Distinct prime factors32, 3, 683
Number of divisors24
Sum of divisors σ(n)133,380
Aliquot sum84,204sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)16,368integers below n that share no factor with it
Carmichael function λ(n)2,046the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,368
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 683, 1,366, 2,049, 2,732, 4,098, 5,464, 6,147, 8,196, 12,294, 16,392, 24,588, 49,17624 in total

Arithmetic

Previous number49,175
Next number49,177
Double98,352
Half24,588
Square root221.756623351≈irrational, shown to 9 decimal places
Cube root36.636816845≈
Negation-49,176
Reciprocal0.0000203351≈

Representations

Decimal49,176
Binary110000000001100016 bits
Octal140030
HexadecimalC018
Base 3611Y0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand, one hundred and seventy-six
Ordinalforty-nine thousand, one hundred and seventy-sixth
Scientific notation4.9176 × 10^4
Engineering notation49.176 × 10^3

In other bases

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

Bit-level

1100000000011000
Bit length16 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits12within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes2c0 18
Gray code1010000000010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100000000011000
32-bit00000000000000001100000000011000
64-bit0000000000000000000000000000000000000000000000001100000000011000
One's complement0011111111100111at 16 bits, every bit flipped
Bits reversed0001100000000011at 16 bits
Rotated left by 11000000000110001at 16 bits, wrapping
Shifted left by 111000000000110000= 98,352, no wrap
Shifted right by 1110000000001100= 24,588, discarding the low bit
These bits as a double2.42961722 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,177+1
Previous prime49,171−5
Distance to nearest prime1
Nearest square below48,841
Nearest square above49,284

Powers & multiples

49,176 to the power 22,418,278,976
49,176 to the power 3118,921,286,923,776
49,176 to the power 45,848,073,205,763,608,576
49,176 to the power 5287,584,847,966,631,215,333,376
First ten multiples49,176, 98,352, 147,528, 196,704, 245,880, 295,056, 344,232, 393,408, 442,584, 491,760
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time
Highest value reached49,176
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,176 → 24,588 → 12,294 → 6,147 → 18,442 → 9,221 → 27,664 → 13,832 → 6,916 → 3,458 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,917,600%
49,176% as a decimal491.76
49,176% of 10049,176
49,176% of 1,000491,760
As a fraction of 10049,176/100

Read another way

As bytes48.023 KiB
As a 24-bit colour#00C018

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