Recognised as Number

35,869

Positive
Odd
Prime
5 digits

35,869 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value35,869

Digit count5

Digit sum31

Digit product6,480

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation35,869

Distinct prime factors135,869

Number of divisors2

Sum of divisors σ(n)35,870

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)35,868the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 35,8692 in total

Arithmetic

Previous number35,868

Next number35,870

Double71,738

Half17,934.5

Square1,286,585,161

Cube46,148,523,139,909

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

Cube root32.979172655≈

Negation-35,869

Reciprocal0.0000278792≈

Representations

Decimal35,869

Binary100011000001110116 bits

Octal106035

Hexadecimal8C1D

Base 36ROD

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

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

Ordinalthirty-five thousand, eight hundred and sixty-ninth

Scientific notation3.5869 × 10^4

Engineering notation35.869 × 10^3

In other bases

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

Quinary2121434base 5; one hand: 7 digits

Septenary206401base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000110000011101

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 1d

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

At each machine width

16-bit1000110000011101

32-bit00000000000000001000110000011101

64-bit0000000000000000000000000000000000000000000000001000110000011101

One's complement0111001111100010at 16 bits, every bit flipped

Bits reversed1011100000110001at 16 bits

Rotated left by 10001100000111011at 16 bits, wrapping

Shifted left by 110001100000111010= 71,738, no wrap

Shifted right by 1100011000001110= 17,934, discarding the low bit

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

Nearest landmarks

Next prime35,879+10

Previous prime35,863−6

Distance to nearest prime0, it is prime

Nearest square below35,721

Nearest square above36,100

Powers & multiples

35,869 to the power 21,286,585,161

35,869 to the power 346,148,523,139,909

35,869 to the power 41,655,301,376,505,395,921

35,869 to the power 559,374,005,073,872,046,290,349

First ten multiples35,869, 71,738, 107,607, 143,476, 179,345, 215,214, 251,083, 286,952, 322,821, 358,690

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached107,6083× the starting value

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

First steps35,869 → 107,608 → 53,804 → 26,902 → 13,451 → 40,354 → 20,177 → 60,532 → 30,266 → 15,133 → …

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

As a percentage & fraction

As a percentage3,586,900%

35,869% as a decimal358.69

35,869% of 10035,869

35,869% of 1,000358,690

As a fraction of 10035,869/100

Read another way

As seconds9 hours, 57 minutes and 49 seconds

As bytes35.028 KiB

As a 24-bit colour#008C1D

Keep nerding

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