Recognised as Number

49,615

Positive
Odd
Composite
5 digits

49,615 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value49,615

Digit count5

Digit sum25

Digit product1,080

Multiplicative persistence2times 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 factorisation5 × 9,923

Distinct prime factors25, 9,923

Number of divisors4

Sum of divisors σ(n)59,544

Aliquot sum9,929sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)19,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 39,688

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 9,923, 49,6154 in total

Arithmetic

Previous number49,614

Next number49,616

Double99,230

Half24,807.5

Square2,461,648,225

Cube122,134,676,683,375

Square root222.744247962≈irrational, shown to 9 decimal places

Cube root36.745514439≈

Negation-49,615

Reciprocal0.0000201552≈

Representations

Decimal49,615

Binary110000011100111116 bits

Octal140717

HexadecimalC1CF

Base 3612A7

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

In wordsforty-nine thousand, six hundred and fifteen

Ordinalforty-nine thousand, six hundred and fifteenth

Scientific notation4.9615 × 10^4

Engineering notation49.615 × 10^3

In other bases

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

Quinary3041430base 5; one hand: 7 digits

Septenary264436base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100000111001111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

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

Bytes2c1 cf

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

At each machine width

16-bit1100000111001111

32-bit00000000000000001100000111001111

64-bit0000000000000000000000000000000000000000000000001100000111001111

One's complement0011111000110000at 16 bits, every bit flipped

Bits reversed1111001110000011at 16 bits

Rotated left by 11000001110011111at 16 bits, wrapping

Shifted left by 111000001110011110= 99,230, no wrap

Shifted right by 1110000011100111= 24,807, discarding the low bit

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

Nearest landmarks

Next prime49,627+12

Previous prime49,613−2

Distance to nearest prime2

Nearest square below49,284

Nearest square above49,729

Powers & multiples

49,615 to the power 22,461,648,225

49,615 to the power 3122,134,676,683,375

49,615 to the power 46,059,711,983,645,650,625

49,615 to the power 5300,652,610,068,578,955,759,375

First ten multiples49,615, 99,230, 148,845, 198,460, 248,075, 297,690, 347,305, 396,920, 446,535, 496,150

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached502,36010× the starting value

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

First steps49,615 → 148,846 → 74,423 → 223,270 → 111,635 → 334,906 → 167,453 → 502,360 → 251,180 → 125,590 → …

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

As a percentage & fraction

As a percentage4,961,500%

49,615% as a decimal496.15

49,615% of 10049,615

49,615% of 1,000496,150

As a fraction of 10049,615/100

Read another way

As seconds13 hours, 46 minutes and 55 seconds

As bytes48.452 KiB

As a 24-bit colour#00C1CF

Keep nerding

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