Recognised as Number

49,003

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value49,003

Digit count5

Digit sum16

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation49,003

Distinct prime factors149,003

Number of divisors2

Sum of divisors σ(n)49,004

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)49,002integers below n that share no factor with it

Carmichael function λ(n)49,002the 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,0032 in total

Arithmetic

Previous number49,002

Next number49,004

Double98,006

Half24,501.5

Square2,401,294,009

Cube117,670,610,323,027

Square root221.366212417≈irrational, shown to 9 decimal places

Cube root36.593803882≈

Negation-49,003

Reciprocal0.0000204069≈

Representations

Decimal49,003

Binary101111110110101116 bits

Octal137553

HexadecimalBF6B

Base 3611T7

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-nine thousand and three

Ordinalforty-nine thousand and third

Scientific notation4.9003 × 10^4

Engineering notation49.003 × 10^3

In other bases

Ternary2111012221base 3; the most digit-efficient integer base after e: 10 digits

Quinary3032003base 5; one hand: 7 digits

Septenary262603base 7: 6 digits

Nonary74187base 9; each digit is two ternary digits: 5 digits

Duodecimal24437base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal62a3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal13:36:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T1111T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11100000010111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011111101101011

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 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

Bytes2bf 6b

Gray code1110000011011110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011111101101011

32-bit00000000000000001011111101101011

64-bit0000000000000000000000000000000000000000000000001011111101101011

One's complement0100000010010100at 16 bits, every bit flipped

Bits reversed1101011011111101at 16 bits

Rotated left by 10111111011010111at 16 bits, wrapping

Shifted left by 110111111011010110= 98,006, no wrap

Shifted right by 1101111110110101= 24,501, discarding the low bit

These bits as a double2.42106988 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,009+6

Previous prime48,991−12

Distance to nearest prime0, it is prime

Nearest square below48,841

Nearest square above49,284

Powers & multiples

49,003 to the power 22,401,294,009

49,003 to the power 3117,670,610,323,027

49,003 to the power 45,766,212,917,659,292,081

49,003 to the power 5282,561,731,604,058,289,845,243

First ten multiples49,003, 98,006, 147,009, 196,012, 245,015, 294,018, 343,021, 392,024, 441,027, 490,030

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 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 7

Divisible by 100No, remainder 3

Collatz (3n + 1) trajectory

Steps to reach 1158the total stopping time

Highest value reached220,5164× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps49,003 → 147,010 → 73,505 → 220,516 → 110,258 → 55,129 → 165,388 → 82,694 → 41,347 → 124,042 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,900,300%

49,003% as a decimal490.03

49,003% of 10049,003

49,003% of 1,000490,030

As a fraction of 10049,003/100

Read another way

As seconds13 hours, 36 minutes and 43 seconds

As bytes47.854 KiB

As a 24-bit colour#00BF6B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.