Recognised as Number

49,902

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value49,902

Digit count5

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 8,317

Distinct prime factors32, 3, 8,317

Number of divisors8

Sum of divisors σ(n)99,816

Aliquot sum49,914sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)8,316the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,632

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 8,317, 16,634, 24,951, 49,9028 in total

Arithmetic

Previous number49,901

Next number49,903

Double99,804

Half24,951

Square2,490,209,604

Cube124,266,439,658,808

Square root223.387555607≈irrational, shown to 9 decimal places

Cube root36.816230238≈

Negation-49,902

Reciprocal0.0000200393≈

Representations

Decimal49,902

Binary110000101110111016 bits

Octal141356

HexadecimalC2EE

Base 3612I6

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

In wordsforty-nine thousand, nine hundred and two

Ordinalforty-nine thousand, nine hundred and second

Scientific notation4.9902 × 10^4

Engineering notation49.902 × 10^3

In other bases

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

Quinary3044102base 5; one hand: 7 digits

Septenary265326base 7: 6 digits

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

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

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

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

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

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

Bit-level

1100001011101110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2c2 ee

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

At each machine width

16-bit1100001011101110

32-bit00000000000000001100001011101110

64-bit0000000000000000000000000000000000000000000000001100001011101110

One's complement0011110100010001at 16 bits, every bit flipped

Bits reversed0111011101000011at 16 bits

Rotated left by 11000010111011101at 16 bits, wrapping

Shifted left by 111000010111011100= 99,804, no wrap

Shifted right by 1110000101110111= 24,951, discarding the low bit

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

Nearest landmarks

Next prime49,919+17

Previous prime49,891−11

Distance to nearest prime11

Nearest square below49,729

Nearest square above50,176

Powers & multiples

49,902 to the power 22,490,209,604

49,902 to the power 3124,266,439,658,808

49,902 to the power 46,201,143,871,853,836,816

49,902 to the power 5309,449,481,493,250,164,792,032

First ten multiples49,902, 99,804, 149,706, 199,608, 249,510, 299,412, 349,314, 399,216, 449,118, 499,020

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1202the total stopping time

Highest value reached250,5045× the starting value

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

First steps49,902 → 24,951 → 74,854 → 37,427 → 112,282 → 56,141 → 168,424 → 84,212 → 42,106 → 21,053 → …

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

As a percentage & fraction

As a percentage4,990,200%

49,902% as a decimal499.02

49,902% of 10049,902

49,902% of 1,000499,020

As a fraction of 10049,902/100

Read another way

As seconds13 hours, 51 minutes and 42 seconds

As bytes48.732 KiB

As a 24-bit colour#00C2EE

Keep nerding

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