Recognised as Number
49
- Positive
- Odd
- Composite
- Perfect square
- 2 digits
49 is an odd 2-digit integer and a composite number. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value49
Digit count2
Digit sum13
Digit product36
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 7²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2
Distinct prime factors17
Number of divisors3
Sum of divisors σ(n)57
Aliquot sum8sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)42integers below n that share no factor with it
Carmichael function λ(n)42the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 493 in total
Arithmetic
Representations
Decimal49
Binary1100016 bits
Octal61
Hexadecimal31
Base 361D
Roman numeralXLIX
In wordsforty-nine
Ordinalforty-ninth
Scientific notation4.9 × 10^1
Engineering notation49
In other bases
Ternary1211base 3; the most digit-efficient integer base after e: 4 digits
Quinary144base 5; one hand: 3 digits
Septenary100base 7: 3 digits
Nonary54base 9; each digit is two ternary digits: 2 digits
Duodecimal41base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 2 digits
Vigesimal29base 20; hands and feet, and the Mayan and Yoruba systems: 2 digits
Sexagesimal49base 60; Babylonian, and still how an hour and a circle are divided: 1 digit
Balanced ternary1TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00110001
Bit length6 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits3within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 5worth 32
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes131
Gray code101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
8-bit00110001
16-bit0000000000110001
32-bit00000000000000000000000000110001
64-bit0000000000000000000000000000000000000000000000000000000000110001
One's complement11001110at 8 bits, every bit flipped
Bits reversed10001100at 8 bits
Rotated left by 101100010at 8 bits, wrapping
Shifted left by 11100010= 98, no wrap
Shifted right by 111000= 24, discarding the low bit
These bits as a double2.42092166 × 10^-322≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
49 to the power 22,401
49 to the power 3117,649
49 to the power 45,764,801
49 to the power 5282,475,249
First ten multiples49, 98, 147, 196, 245, 294, 343, 392, 441, 490
Powers of twoBetween 2^5 (32) and 2^6 (64)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 124the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49 → 148 → 74 → 37 → 112 → 56 → 28 → 14 → 7 → 22 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4,900%
49% as a decimal0.49
49% of 10049
49% of 1,000490
As a fraction of 10049/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 49
Other readings
Nerdulate something else
Nothing in mind? Surprise me · today’s page