Nerdulator> put something in

Recognised as Number

35,874

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value35,874
Digit count5
Digit sum27
Digit product3,360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 1,993
Distinct prime factors32, 3, 1,993
Number of divisors12
Sum of divisors σ(n)77,766
Aliquot sum41,892sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)11,952integers below n that share no factor with it
Carmichael function λ(n)1,992the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 11,952
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 1,993, 3,986, 5,979, 11,958, 17,937, 35,87412 in total

Arithmetic

Previous number35,873
Next number35,875
Double71,748
Half17,937
Square root189.404329412≈irrational, shown to 9 decimal places
Cube root32.980704974≈
Negation-35,874
Reciprocal0.0000278753≈

Representations

Decimal35,874
Binary100011000010001016 bits
Octal106042
Hexadecimal8C22
Base 36ROI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-five thousand, eight hundred and seventy-four
Ordinalthirty-five thousand, eight hundred and seventy-fourth
Scientific notation3.5874 × 10^4
Engineering notation35.874 × 10^3

In other bases

Ternary1211012200base 3; the most digit-efficient integer base after e: 10 digits
Quinary2121444base 5; one hand: 7 digits
Septenary206406base 7: 6 digits
Nonary54180base 9; each digit is two ternary digits: 5 digits
Duodecimal18916base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal49debase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:57:54base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT111T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001110001100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000110000100010
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes28c 22
Gray code1100101000110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000110000100010
32-bit00000000000000001000110000100010
64-bit0000000000000000000000000000000000000000000000001000110000100010
One's complement0111001111011101at 16 bits, every bit flipped
Bits reversed0100010000110001at 16 bits
Rotated left by 10001100001000101at 16 bits, wrapping
Shifted left by 110001100001000100= 71,748, no wrap
Shifted right by 1100011000010001= 17,937, discarding the low bit
These bits as a double1.7724111 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime35,879+5
Previous prime35,869−5
Distance to nearest prime5
Nearest square below35,721
Nearest square above36,100

Powers & multiples

35,874 to the power 21,286,943,876
35,874 to the power 346,167,824,607,624
35,874 to the power 41,656,224,539,973,903,376
35,874 to the power 559,415,399,147,023,809,710,624
First ten multiples35,874, 71,748, 107,622, 143,496, 179,370, 215,244, 251,118, 286,992, 322,866, 358,740
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time
Highest value reached53,8121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps35,874 → 17,937 → 53,812 → 26,906 → 13,453 → 40,360 → 20,180 → 10,090 → 5,045 → 15,136 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,587,400%
35,874% as a decimal358.74
35,874% of 10035,874
35,874% of 1,000358,740
As a fraction of 10035,874/100

Read another way

As bytes35.033 KiB
As a 24-bit colour#008C22

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 “35874” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.