Recognised as Number

35,867

Positive
Odd
Composite
5 digits

35,867 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value35,867

Digit count5

Digit sum29

Digit product5,040

Multiplicative persistence2times 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 factorisation13 × 31 × 89

Distinct prime factors313, 31, 89

Number of divisors8

Sum of divisors σ(n)40,320

Aliquot sum4,453sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 13, 31, 89, 403, 1,157, 2,759, 35,8678 in total

Arithmetic

Previous number35,866

Next number35,868

Double71,734

Half17,933.5

Square1,286,441,689

Cube46,140,804,059,363

Square root189.385849524≈irrational, shown to 9 decimal places

Cube root32.978559688≈

Negation-35,867

Reciprocal0.0000278808≈

Representations

Decimal35,867

Binary100011000001101116 bits

Octal106033

Hexadecimal8C1B

Base 36ROB

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

In wordsthirty-five thousand, eight hundred and sixty-seven

Ordinalthirty-five thousand, eight hundred and sixty-seventh

Scientific notation3.5867 × 10^4

Engineering notation35.867 × 10^3

In other bases

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

Quinary2121432base 5; one hand: 7 digits

Septenary206366base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000110000011011

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

Bytes28c 1b

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

At each machine width

16-bit1000110000011011

32-bit00000000000000001000110000011011

64-bit0000000000000000000000000000000000000000000000001000110000011011

One's complement0111001111100100at 16 bits, every bit flipped

Bits reversed1101100000110001at 16 bits

Rotated left by 10001100000110111at 16 bits, wrapping

Shifted left by 110001100000110110= 71,734, no wrap

Shifted right by 1100011000001101= 17,933, discarding the low bit

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

Nearest landmarks

Next prime35,869+2

Previous prime35,863−4

Distance to nearest prime2

Nearest square below35,721

Nearest square above36,100

Powers & multiples

35,867 to the power 21,286,441,689

35,867 to the power 346,140,804,059,363

35,867 to the power 41,654,932,219,197,172,721

35,867 to the power 559,357,453,905,944,993,984,107

First ten multiples35,867, 71,734, 107,601, 143,468, 179,335, 215,202, 251,069, 286,936, 322,803, 358,670

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 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 11

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached775,63621× the starting value

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

First steps35,867 → 107,602 → 53,801 → 161,404 → 80,702 → 40,351 → 121,054 → 60,527 → 181,582 → 90,791 → …

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

As a percentage & fraction

As a percentage3,586,700%

35,867% as a decimal358.67

35,867% of 10035,867

35,867% of 1,000358,670

As a fraction of 10035,867/100

Read another way

As seconds9 hours, 57 minutes and 47 seconds

As bytes35.026 KiB

As a 24-bit colour#008C1B

Keep nerding

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