Recognised as Number

49,575

Positive
Odd
Composite
5 digits

49,575 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value49,575

Digit count5

Digit sum30

Digit product6,300

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5^2 × 661

Distinct prime factors33, 5, 661

Number of divisors12

Sum of divisors σ(n)82,088

Aliquot sum32,513sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,400

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 15, 25, 75, 661, 1,983, 3,305, 9,915, 16,525, 49,57512 in total

Arithmetic

Previous number49,574

Next number49,576

Double99,150

Half24,787.5

Square2,457,680,625

Cube121,839,516,984,375

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

Cube root36.735636944≈

Negation-49,575

Reciprocal0.0000201715≈

Representations

Decimal49,575

Binary110000011010011116 bits

Octal140647

HexadecimalC1A7

Base 361293

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

In wordsforty-nine thousand, five hundred and seventy-five

Ordinalforty-nine thousand, five hundred and seventy-fifth

Scientific notation4.9575 × 10^4

Engineering notation49.575 × 10^3

In other bases

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

Quinary3041300base 5; one hand: 7 digits

Septenary264351base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100000110100111

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Bytes2c1 a7

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

At each machine width

16-bit1100000110100111

32-bit00000000000000001100000110100111

64-bit0000000000000000000000000000000000000000000000001100000110100111

One's complement0011111001011000at 16 bits, every bit flipped

Bits reversed1110010110000011at 16 bits

Rotated left by 11000001101001111at 16 bits, wrapping

Shifted left by 111000001101001110= 99,150, no wrap

Shifted right by 1110000011010011= 24,787, discarding the low bit

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

Nearest landmarks

Next prime49,597+22

Previous prime49,559−16

Distance to nearest prime16

Nearest square below49,284

Nearest square above49,729

Powers & multiples

49,575 to the power 22,457,680,625

49,575 to the power 3121,839,516,984,375

49,575 to the power 46,040,194,054,500,390,625

49,575 to the power 5299,442,620,251,856,865,234,375

First ten multiples49,575, 99,150, 148,725, 198,300, 247,875, 297,450, 347,025, 396,600, 446,175, 495,750

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 1295the total stopping time

Highest value reached11,003,416221× the starting value

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

First steps49,575 → 148,726 → 74,363 → 223,090 → 111,545 → 334,636 → 167,318 → 83,659 → 250,978 → 125,489 → …

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

As a percentage & fraction

As a percentage4,957,500%

49,575% as a decimal495.75

49,575% of 10049,575

49,575% of 1,000495,750

As a fraction of 10049,575/100

Read another way

As seconds13 hours, 46 minutes and 15 seconds

As bytes48.413 KiB

As a 24-bit colour#00C1A7

Keep nerding

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