Nerdulator> put something in

Recognised as Number

49,004

  • Positive
  • Even
  • Composite
  • 5 digits

49,004 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value49,004
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 12,251
Distinct prime factors22, 12,251
Number of divisors6
Sum of divisors σ(n)85,764
Aliquot sum36,760sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)24,500integers below n that share no factor with it
Carmichael function λ(n)12,250the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,500
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 12,251, 24,502, 49,0046 in total

Arithmetic

Previous number49,003
Next number49,005
Double98,008
Half24,502
Square root221.368471106≈irrational, shown to 9 decimal places
Cube root36.594052803≈
Negation-49,004
Reciprocal0.0000204065≈

Representations

Decimal49,004
Binary101111110110110016 bits
Octal137554
HexadecimalBF6C
Base 3611T8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand and four
Ordinalforty-nine thousand and fourth
Scientific notation4.9004 × 10^4
Engineering notation49.004 × 10^3

In other bases

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

Bit-level

1011111101101100
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2bf 6c
Gray code1110000011011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011111101101100
32-bit00000000000000001011111101101100
64-bit0000000000000000000000000000000000000000000000001011111101101100
One's complement0100000010010011at 16 bits, every bit flipped
Bits reversed0011011011111101at 16 bits
Rotated left by 10111111011011001at 16 bits, wrapping
Shifted left by 110111111011011000= 98,008, no wrap
Shifted right by 1101111110110110= 24,502, discarding the low bit
These bits as a double2.42111929 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

49,004 to the power 22,401,392,016
49,004 to the power 3117,677,814,352,064
49,004 to the power 45,766,683,614,508,544,256
49,004 to the power 5282,590,563,845,376,702,721,024
First ten multiples49,004, 98,008, 147,012, 196,016, 245,020, 294,024, 343,028, 392,032, 441,036, 490,040
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1158the total stopping time
Highest value reached93,0401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,004 → 24,502 → 12,251 → 36,754 → 18,377 → 55,132 → 27,566 → 13,783 → 41,350 → 20,675 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,900,400%
49,004% as a decimal490.04
49,004% of 10049,004
49,004% of 1,000490,040
As a fraction of 10049,004/100

Read another way

As bytes47.855 KiB
As a 24-bit colour#00BF6C

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