Recognised as Number

40,197

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value40,197

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 13,399

Distinct prime factors23, 13,399

Number of divisors4

Sum of divisors σ(n)53,600

Aliquot sum13,403sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 13,399, 40,1974 in total

Arithmetic

Previous number40,196

Next number40,198

Double80,394

Half20,098.5

Square1,615,798,809

Cube64,950,264,725,373

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

Cube root34.255571225≈

Negation-40,197

Reciprocal0.0000248775≈

Representations

Decimal40,197

Binary100111010000010116 bits

Octal116405

Hexadecimal9D05

Base 36V0L

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

In wordsforty thousand, one hundred and ninety-seven

Ordinalforty thousand, one hundred and ninety-seventh

Scientific notation4.0197 × 10^4

Engineering notation40.197 × 10^3

In other bases

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

Quinary2241242base 5; one hand: 7 digits

Septenary225123base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001110100000101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes29d 05

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

At each machine width

16-bit1001110100000101

32-bit00000000000000001001110100000101

64-bit0000000000000000000000000000000000000000000000001001110100000101

One's complement0110001011111010at 16 bits, every bit flipped

Bits reversed1010000010111001at 16 bits

Rotated left by 10011101000001011at 16 bits, wrapping

Shifted left by 110011101000001010= 80,394, no wrap

Shifted right by 1100111010000010= 20,098, discarding the low bit

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

Nearest landmarks

Next prime40,213+16

Previous prime40,193−4

Distance to nearest prime4

Nearest square below40,000

Nearest square above40,401

Powers & multiples

40,197 to the power 21,615,798,809

40,197 to the power 364,950,264,725,373

40,197 to the power 42,610,805,791,165,818,481

40,197 to the power 5104,946,560,387,492,405,480,757

First ten multiples40,197, 80,394, 120,591, 160,788, 200,985, 241,182, 281,379, 321,576, 361,773, 401,970

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached120,5923× the starting value

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

First steps40,197 → 120,592 → 60,296 → 30,148 → 15,074 → 7,537 → 22,612 → 11,306 → 5,653 → 16,960 → …

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

As a percentage & fraction

As a percentage4,019,700%

40,197% as a decimal401.97

40,197% of 10040,197

40,197% of 1,000401,970

As a fraction of 10040,197/100

Read another way

As seconds11 hours, 9 minutes and 57 seconds

As bytes39.255 KiB

As a 24-bit colour#009D05

Keep nerding

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