Recognised as Number

40,199

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value40,199

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation61 × 659

Distinct prime factors261, 659

Number of divisors4

Sum of divisors σ(n)40,920

Aliquot sum721sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 61, 659, 40,1994 in total

Arithmetic

Previous number40,198

Next number40,200

Double80,398

Half20,099.5

Square1,615,959,601

Cube64,959,960,000,599

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

Cube root34.256139344≈

Negation-40,199

Reciprocal0.0000248762≈

Representations

Decimal40,199

Binary100111010000011116 bits

Octal116407

Hexadecimal9D07

Base 36V0N

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

In wordsforty thousand, one hundred and ninety-nine

Ordinalforty thousand, one hundred and ninety-ninth

Scientific notation4.0199 × 10^4

Engineering notation40.199 × 10^3

In other bases

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

Quinary2241244base 5; one hand: 7 digits

Septenary225125base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001110100000111

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

Bytes29d 07

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

At each machine width

16-bit1001110100000111

32-bit00000000000000001001110100000111

64-bit0000000000000000000000000000000000000000000000001001110100000111

One's complement0110001011111000at 16 bits, every bit flipped

Bits reversed1110000010111001at 16 bits

Rotated left by 10011101000001111at 16 bits, wrapping

Shifted left by 110011101000001110= 80,398, no wrap

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

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

Nearest landmarks

Next prime40,213+14

Previous prime40,193−6

Distance to nearest prime6

Nearest square below40,000

Nearest square above40,401

Powers & multiples

40,199 to the power 21,615,959,601

40,199 to the power 364,959,960,000,599

40,199 to the power 42,611,325,432,064,079,201

40,199 to the power 5104,972,671,043,543,919,800,999

First ten multiples40,199, 80,398, 120,597, 160,796, 200,995, 241,194, 281,393, 321,592, 361,791, 401,990

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 99

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time

Highest value reached386,3689× the starting value

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

First steps40,199 → 120,598 → 60,299 → 180,898 → 90,449 → 271,348 → 135,674 → 67,837 → 203,512 → 101,756 → …

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

As a percentage & fraction

As a percentage4,019,900%

40,199% as a decimal401.99

40,199% of 10040,199

40,199% of 1,000401,990

As a fraction of 10040,199/100

Read another way

As seconds11 hours, 9 minutes and 59 seconds

As bytes39.257 KiB

As a 24-bit colour#009D07

Keep nerding

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