Recognised as Number

40,198

Positive
Even
Composite
5 digits

40,198 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value40,198

Digit count5

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 101 × 199

Distinct prime factors32, 101, 199

Number of divisors8

Sum of divisors σ(n)61,200

Aliquot sum21,002sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 101, 199, 202, 398, 20,099, 40,1988 in total

Arithmetic

Previous number40,197

Next number40,199

Double80,396

Half20,099

Square1,615,879,204

Cube64,955,112,242,392

Square root200.494388949≈irrational, shown to 9 decimal places

Cube root34.255855287≈

Negation-40,198

Reciprocal0.0000248769≈

Representations

Decimal40,198

Binary100111010000011016 bits

Octal116406

Hexadecimal9D06

Base 36V0M

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

In wordsforty thousand, one hundred and ninety-eight

Ordinalforty thousand, one hundred and ninety-eighth

Scientific notation4.0198 × 10^4

Engineering notation40.198 × 10^3

In other bases

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

Quinary2241243base 5; one hand: 7 digits

Septenary225124base 7: 6 digits

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

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

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

Sexagesimal11:9:58base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1001110100000110

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 11 trailing zero

Power of twoNo

Bytes29d 06

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

At each machine width

16-bit1001110100000110

32-bit00000000000000001001110100000110

64-bit0000000000000000000000000000000000000000000000001001110100000110

One's complement0110001011111001at 16 bits, every bit flipped

Bits reversed0110000010111001at 16 bits

Rotated left by 10011101000001101at 16 bits, wrapping

Shifted left by 110011101000001100= 80,396, no wrap

Shifted right by 1100111010000011= 20,099, discarding the low bit

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

Nearest landmarks

Next prime40,213+15

Previous prime40,193−5

Distance to nearest prime5

Nearest square below40,000

Nearest square above40,401

Powers & multiples

40,198 to the power 21,615,879,204

40,198 to the power 364,955,112,242,392

40,198 to the power 42,611,065,601,919,673,616

40,198 to the power 5104,959,615,065,967,040,015,968

First ten multiples40,198, 80,396, 120,594, 160,792, 200,990, 241,188, 281,386, 321,584, 361,782, 401,980

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11No, remainder 4

Divisible by 12No, remainder 10

Divisible by 100No, remainder 98

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached90,4482× the starting value

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

First steps40,198 → 20,099 → 60,298 → 30,149 → 90,448 → 45,224 → 22,612 → 11,306 → 5,653 → 16,960 → …

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

As a percentage & fraction

As a percentage4,019,800%

40,198% as a decimal401.98

40,198% of 10040,198

40,198% of 1,000401,980

As a fraction of 10040,198/100

Read another way

As seconds11 hours, 9 minutes and 58 seconds

As bytes39.256 KiB

As a 24-bit colour#009D06

Keep nerding

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