Recognised as Number

35,807

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value35,807

Digit count5

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation61 × 587

Distinct prime factors261, 587

Number of divisors4

Sum of divisors σ(n)36,456

Aliquot sum649sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 61, 587, 35,8074 in total

Arithmetic

Previous number35,806

Next number35,808

Double71,614

Half17,903.5

Square1,282,141,249

Cube45,909,631,702,943

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

Cube root32.960160064≈

Negation-35,807

Reciprocal0.0000279275≈

Representations

Decimal35,807

Binary100010111101111116 bits

Octal105737

Hexadecimal8BDF

Base 36RMN

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

In wordsthirty-five thousand, eight hundred and seven

Ordinalthirty-five thousand, eight hundred and seventh

Scientific notation3.5807 × 10^4

Engineering notation35.807 × 10^3

In other bases

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

Quinary2121212base 5; one hand: 7 digits

Septenary206252base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000101111011111

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

Bit parityodd11 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

Bytes28b df

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

At each machine width

16-bit1000101111011111

32-bit00000000000000001000101111011111

64-bit0000000000000000000000000000000000000000000000001000101111011111

One's complement0111010000100000at 16 bits, every bit flipped

Bits reversed1111101111010001at 16 bits

Rotated left by 10001011110111111at 16 bits, wrapping

Shifted left by 110001011110111110= 71,614, no wrap

Shifted right by 1100010111101111= 17,903, discarding the low bit

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

Nearest landmarks

Next prime35,809+2

Previous prime35,803−4

Distance to nearest prime2

Nearest square below35,721

Nearest square above36,100

Powers & multiples

35,807 to the power 21,282,141,249

35,807 to the power 345,909,631,702,943

35,807 to the power 41,643,886,182,387,280,001

35,807 to the power 558,862,632,532,741,334,995,807

First ten multiples35,807, 71,614, 107,421, 143,228, 179,035, 214,842, 250,649, 286,456, 322,263, 358,070

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 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time

Highest value reached543,83215× the starting value

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

First steps35,807 → 107,422 → 53,711 → 161,134 → 80,567 → 241,702 → 120,851 → 362,554 → 181,277 → 543,832 → …

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

As a percentage & fraction

As a percentage3,580,700%

35,807% as a decimal358.07

35,807% of 10035,807

35,807% of 1,000358,070

As a fraction of 10035,807/100

Read another way

As seconds9 hours, 56 minutes and 47 seconds

As bytes34.968 KiB

As a 24-bit colour#008BDF

Keep nerding

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