Nerdulator> put something in

Recognised as Number

35,806

  • Positive
  • Even
  • Composite
  • 5 digits

35,806 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value35,806
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 17,903
Distinct prime factors22, 17,903
Number of divisors4
Sum of divisors σ(n)53,712
Aliquot sum17,906sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)17,902integers below n that share no factor with it
Carmichael function λ(n)17,902the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 17,903, 35,8064 in total

Arithmetic

Previous number35,805
Next number35,807
Double71,612
Half17,903
Square root189.224734113≈irrational, shown to 9 decimal places
Cube root32.959853229≈
Negation-35,806
Reciprocal0.0000279283≈

Representations

Decimal35,806
Binary100010111101111016 bits
Octal105736
Hexadecimal8BDE
Base 36RMM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-five thousand, eight hundred and six
Ordinalthirty-five thousand, eight hundred and sixth
Scientific notation3.5806 × 10^4
Engineering notation35.806 × 10^3

In other bases

Ternary1211010011base 3; the most digit-efficient integer base after e: 10 digits
Quinary2121211base 5; one hand: 7 digits
Septenary206251base 7: 6 digits
Nonary54104base 9; each digit is two ternary digits: 5 digits
Duodecimal1887abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal49a6base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:56:46base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT11010011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001110000100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000101111011110
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes28b de
Gray code1100111000110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000101111011110
32-bit00000000000000001000101111011110
64-bit0000000000000000000000000000000000000000000000001000101111011110
One's complement0111010000100001at 16 bits, every bit flipped
Bits reversed0111101111010001at 16 bits
Rotated left by 10001011110111101at 16 bits, wrapping
Shifted left by 110001011110111100= 71,612, no wrap
Shifted right by 1100010111101111= 17,903, discarding the low bit
These bits as a double1.76905145 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime35,809+3
Previous prime35,803−3
Distance to nearest prime3
Nearest square below35,721
Nearest square above36,100

Powers & multiples

35,806 to the power 21,282,069,636
35,806 to the power 345,905,785,386,616
35,806 to the power 41,643,702,551,553,172,496
35,806 to the power 558,854,413,560,912,894,391,776
First ten multiples35,806, 71,612, 107,418, 143,224, 179,030, 214,836, 250,642, 286,448, 322,254, 358,060
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 6

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time
Highest value reached305,9088× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps35,806 → 17,903 → 53,710 → 26,855 → 80,566 → 40,283 → 120,850 → 60,425 → 181,276 → 90,638 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,580,600%
35,806% as a decimal358.06
35,806% of 10035,806
35,806% of 1,000358,060
As a fraction of 10035,806/100

Read another way

As bytes34.967 KiB
As a 24-bit colour#008BDE

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “35806” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.