Recognised as Number

36,197

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value36,197

Digit count5

Digit sum26

Digit product1,134

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 5,171

Distinct prime factors27, 5,171

Number of divisors4

Sum of divisors σ(n)41,376

Aliquot sum5,179sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)15,510the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,020

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 5,171, 36,1974 in total

Arithmetic

Previous number36,196

Next number36,198

Double72,394

Half18,098.5

Square1,310,222,809

Cube47,426,135,017,373

Square root190.255091916≈irrational, shown to 9 decimal places

Cube root33.079392557≈

Negation-36,197

Reciprocal0.0000276266≈

Representations

Decimal36,197

Binary100011010110010116 bits

Octal106545

Hexadecimal8D65

Base 36RXH

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

In wordsthirty-six thousand, one hundred and ninety-seven

Ordinalthirty-six thousand, one hundred and ninety-seventh

Scientific notation3.6197 × 10^4

Engineering notation36.197 × 10^3

In other bases

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

Quinary2124242base 5; one hand: 7 digits

Septenary210350base 7: 6 digits

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

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

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

Sexagesimal10:3:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1000110101100101

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

Bytes28d 65

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

At each machine width

16-bit1000110101100101

32-bit00000000000000001000110101100101

64-bit0000000000000000000000000000000000000000000000001000110101100101

One's complement0111001010011010at 16 bits, every bit flipped

Bits reversed1010011010110001at 16 bits

Rotated left by 10001101011001011at 16 bits, wrapping

Shifted left by 110001101011001010= 72,394, no wrap

Shifted right by 1100011010110010= 18,098, discarding the low bit

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

Nearest landmarks

Next prime36,209+12

Previous prime36,191−6

Distance to nearest prime6

Nearest square below36,100

Nearest square above36,481

Powers & multiples

36,197 to the power 21,310,222,809

36,197 to the power 347,426,135,017,373

36,197 to the power 41,716,683,809,223,850,481

36,197 to the power 562,138,803,842,475,715,860,757

First ten multiples36,197, 72,394, 108,591, 144,788, 180,985, 217,182, 253,379, 289,576, 325,773, 361,970

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time

Highest value reached108,5923× the starting value

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

First steps36,197 → 108,592 → 54,296 → 27,148 → 13,574 → 6,787 → 20,362 → 10,181 → 30,544 → 15,272 → …

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

As a percentage & fraction

As a percentage3,619,700%

36,197% as a decimal361.97

36,197% of 10036,197

36,197% of 1,000361,970

As a fraction of 10036,197/100

Read another way

As seconds10 hours, 3 minutes and 17 seconds

As bytes35.349 KiB

As a 24-bit colour#008D65

Keep nerding

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