Nerdulator> put something in

Recognised as Number

49,372

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value49,372
Digit count5
Digit sum25
Digit product1,512
Multiplicative persistence3times 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 factorisation2^2 × 12,343
Distinct prime factors22, 12,343
Number of divisors6
Sum of divisors σ(n)86,408
Aliquot sum37,036sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)24,684integers below n that share no factor with it
Carmichael function λ(n)12,342the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,684
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 12,343, 24,686, 49,3726 in total

Arithmetic

Previous number49,371
Next number49,373
Double98,744
Half24,686
Square root222.198109803≈irrational, shown to 9 decimal places
Cube root36.68542658≈
Negation-49,372
Reciprocal0.0000202544≈

Representations

Decimal49,372
Binary110000001101110016 bits
Octal140334
HexadecimalC0DC
Base 36123G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine thousand, three hundred and seventy-two
Ordinalforty-nine thousand, three hundred and seventy-second
Scientific notation4.9372 × 10^4
Engineering notation49.372 × 10^3

In other bases

Ternary2111201121base 3; the most digit-efficient integer base after e: 10 digits
Quinary3034442base 5; one hand: 7 digits
Septenary263641base 7: 6 digits
Nonary74647base 9; each digit is two ternary digits: 5 digits
Duodecimal246a4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal638cbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:42:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10TTTT1TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100000100101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1100000011011100
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 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
Bytes2c0 dc
Gray code1010000010110010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100000011011100
32-bit00000000000000001100000011011100
64-bit0000000000000000000000000000000000000000000000001100000011011100
One's complement0011111100100011at 16 bits, every bit flipped
Bits reversed0011101100000011at 16 bits
Rotated left by 11000000110111001at 16 bits, wrapping
Shifted left by 111000000110111000= 98,744, no wrap
Shifted right by 1110000001101110= 24,686, discarding the low bit
These bits as a double2.43930091 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime49,391+19
Previous prime49,369−3
Distance to nearest prime3
Nearest square below49,284
Nearest square above49,729

Powers & multiples

49,372 to the power 22,437,594,384
49,372 to the power 3120,348,909,926,848
49,372 to the power 45,941,866,380,908,339,456
49,372 to the power 5293,361,826,958,206,535,621,632
First ten multiples49,372, 98,744, 148,116, 197,488, 246,860, 296,232, 345,604, 394,976, 444,348, 493,720
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1264the total stopping time
Highest value reached975,40019× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,372 → 24,686 → 12,343 → 37,030 → 18,515 → 55,546 → 27,773 → 83,320 → 41,660 → 20,830 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,937,200%
49,372% as a decimal493.72
49,372% of 10049,372
49,372% of 1,000493,720
As a fraction of 10049,372/100

Read another way

As bytes48.215 KiB
As a 24-bit colour#00C0DC

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