Recognised as Number

36,317

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value36,317

Digit count5

Digit sum20

Digit product378

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23 × 1,579

Distinct prime factors223, 1,579

Number of divisors4

Sum of divisors σ(n)37,920

Aliquot sum1,603sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)17,358the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,716

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

SquarefreeYesno repeated prime factor

All divisors1, 23, 1,579, 36,3174 in total

Arithmetic

Previous number36,316

Next number36,318

Double72,634

Half18,158.5

Square1,318,924,489

Cube47,899,380,667,013

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

Cube root33.115907081≈

Negation-36,317

Reciprocal0.0000275353≈

Representations

Decimal36,317

Binary100011011101110116 bits

Octal106735

Hexadecimal8DDD

Base 36S0T

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

In wordsthirty-six thousand, three hundred and seventeen

Ordinalthirty-six thousand, three hundred and seventeenth

Scientific notation3.6317 × 10^4

Engineering notation36.317 × 10^3

In other bases

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

Quinary2130232base 5; one hand: 7 digits

Septenary210611base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000110111011101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

Bit parityeven10 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 dd

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

At each machine width

16-bit1000110111011101

32-bit00000000000000001000110111011101

64-bit0000000000000000000000000000000000000000000000001000110111011101

One's complement0111001000100010at 16 bits, every bit flipped

Bits reversed1011101110110001at 16 bits

Rotated left by 10001101110111011at 16 bits, wrapping

Shifted left by 110001101110111010= 72,634, no wrap

Shifted right by 1100011011101110= 18,158, discarding the low bit

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

Nearest landmarks

Next prime36,319+2

Previous prime36,313−4

Distance to nearest prime2

Nearest square below36,100

Nearest square above36,481

Powers & multiples

36,317 to the power 21,318,924,489

36,317 to the power 347,899,380,667,013

36,317 to the power 41,739,561,807,683,911,121

36,317 to the power 563,175,666,169,656,600,181,357

First ten multiples36,317, 72,634, 108,951, 145,268, 181,585, 217,902, 254,219, 290,536, 326,853, 363,170

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 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 5

Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 1186the total stopping time

Highest value reached1,276,93635× the starting value

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

First steps36,317 → 108,952 → 54,476 → 27,238 → 13,619 → 40,858 → 20,429 → 61,288 → 30,644 → 15,322 → …

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

As a percentage & fraction

As a percentage3,631,700%

36,317% as a decimal363.17

36,317% of 10036,317

36,317% of 1,000363,170

As a fraction of 10036,317/100

Read another way

As seconds10 hours, 5 minutes and 17 seconds

As bytes35.466 KiB

As a 24-bit colour#008DDD

Keep nerding

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