Recognised as Number

35,871

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value35,871

Digit count5

Digit sum24

Digit product840

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 1,087

Distinct prime factors33, 11, 1,087

Number of divisors8

Sum of divisors σ(n)52,224

Aliquot sum16,353sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)5,430the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,720

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 1,087, 3,261, 11,957, 35,8718 in total

Arithmetic

Previous number35,870

Next number35,872

Double71,742

Half17,935.5

Square1,286,728,641

Cube46,156,243,081,311

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

Cube root32.9797856≈

Negation-35,871

Reciprocal0.0000278777≈

Representations

Decimal35,871

Binary100011000001111116 bits

Octal106037

Hexadecimal8C1F

Base 36ROF

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

In wordsthirty-five thousand, eight hundred and seventy-one

Ordinalthirty-five thousand, eight hundred and seventy-first

Scientific notation3.5871 × 10^4

Engineering notation35.871 × 10^3

In other bases

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

Quinary2121441base 5; one hand: 7 digits

Septenary206403base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000110000011111

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

Bytes28c 1f

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

At each machine width

16-bit1000110000011111

32-bit00000000000000001000110000011111

64-bit0000000000000000000000000000000000000000000000001000110000011111

One's complement0111001111100000at 16 bits, every bit flipped

Bits reversed1111100000110001at 16 bits

Rotated left by 10001100000111111at 16 bits, wrapping

Shifted left by 110001100000111110= 71,742, no wrap

Shifted right by 1100011000001111= 17,935, discarding the low bit

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

Nearest landmarks

Next prime35,879+8

Previous prime35,869−2

Distance to nearest prime2

Nearest square below35,721

Nearest square above36,100

Powers & multiples

35,871 to the power 21,286,728,641

35,871 to the power 346,156,243,081,311

35,871 to the power 41,655,670,595,569,706,881

35,871 to the power 559,390,559,933,680,955,528,351

First ten multiples35,871, 71,742, 107,613, 143,484, 179,355, 215,226, 251,097, 286,968, 322,839, 358,710

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached689,52419× the starting value

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

First steps35,871 → 107,614 → 53,807 → 161,422 → 80,711 → 242,134 → 121,067 → 363,202 → 181,601 → 544,804 → …

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

As a percentage & fraction

As a percentage3,587,100%

35,871% as a decimal358.71

35,871% of 10035,871

35,871% of 1,000358,710

As a fraction of 10035,871/100

Read another way

As seconds9 hours, 57 minutes and 51 seconds

As bytes35.03 KiB

As a 24-bit colour#008C1F

Keep nerding

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