Nerdulator> put something in

Recognised as Number

35,797

  • Positive
  • Odd
  • Prime
  • 5 digits

35,797 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,797
Digit count5
Digit sum31
Digit product6,615
Multiplicative persistence3times 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,797
Distinct prime factors135,797
Number of divisors2
Sum of divisors σ(n)35,798
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,796integers below n that share no factor with it
Carmichael function λ(n)35,796the 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,7972 in total

Arithmetic

Previous number35,796
Next number35,798
Double71,594
Square root189.200951372≈irrational, shown to 9 decimal places
Cube root32.957091462≈
Negation-35,797
Reciprocal0.0000279353≈

Representations

Decimal35,797
Binary100010111101010116 bits
Octal105725
Hexadecimal8BD5
Base 36RMD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-five thousand, seven hundred and ninety-seven
Ordinalthirty-five thousand, seven hundred and ninety-seventh
Scientific notation3.5797 × 10^4
Engineering notation35.797 × 10^3

In other bases

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

Bit-level

1000101111010101
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 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 d5
Gray code1100111000111111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000101111010101
32-bit00000000000000001000101111010101
64-bit0000000000000000000000000000000000000000000000001000101111010101
One's complement0111010000101010at 16 bits, every bit flipped
Bits reversed1010101111010001at 16 bits
Rotated left by 10001011110101011at 16 bits, wrapping
Shifted left by 110001011110101010= 71,594, no wrap
Shifted right by 1100010111101010= 17,898, discarding the low bit
These bits as a double1.76860679 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime35,801+4
Previous prime35,771−26
Distance to nearest prime0, it is prime
Nearest square below35,721
Nearest square above36,100

Powers & multiples

35,797 to the power 21,281,425,209
35,797 to the power 345,871,178,206,573
35,797 to the power 41,642,050,566,260,693,681
35,797 to the power 558,780,484,120,434,051,698,757
First ten multiples35,797, 71,594, 107,391, 143,188, 178,985, 214,782, 250,579, 286,376, 322,173, 357,970
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time
Highest value reached107,3923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps35,797 → 107,392 → 53,696 → 26,848 → 13,424 → 6,712 → 3,356 → 1,678 → 839 → 2,518 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,579,700%
35,797% as a decimal357.97
35,797% of 10035,797
35,797% of 1,000357,970
As a fraction of 10035,797/100

Read another way

As bytes34.958 KiB
As a 24-bit colour#008BD5

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