Nerdulator> put something in

Recognised as Number

35,111

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value35,111
Digit count5
Digit sum11
Digit product15
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation35,111
Distinct prime factors135,111
Number of divisors2
Sum of divisors σ(n)35,112
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,110integers below n that share no factor with it
Carmichael function λ(n)35,110the 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,1112 in total

Arithmetic

Previous number35,110
Next number35,112
Double70,222
Square root187.37929448≈irrational, shown to 9 decimal places
Cube root32.745206454≈
Negation-35,111
Reciprocal0.0000284811≈

Representations

Decimal35,111
Binary100010010010011116 bits
Octal104447
Hexadecimal8927
Base 36R3B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-five thousand, one hundred and eleven
Ordinalthirty-five thousand, one hundred and eleventh
Scientific notation3.5111 × 10^4
Engineering notation35.111 × 10^3

In other bases

Ternary1210011102base 3; the most digit-efficient integer base after e: 10 digits
Quinary2110421base 5; one hand: 7 digits
Septenary204236base 7: 6 digits
Nonary53142base 9; each digit is two ternary digits: 5 digits
Duodecimal1839bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal47fbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:45:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT1001111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000100100100111
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
Bytes289 27
Gray code1100110110110100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000100100100111
32-bit00000000000000001000100100100111
64-bit0000000000000000000000000000000000000000000000001000100100100111
One's complement0111011011011000at 16 bits, every bit flipped
Bits reversed1110010010010001at 16 bits
Rotated left by 10001001001001111at 16 bits, wrapping
Shifted left by 110001001001001110= 70,222, no wrap
Shifted right by 1100010010010011= 17,555, discarding the low bit
These bits as a double1.73471389 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime35,117+6
Previous prime35,107−4
Distance to nearest prime0, it is prime
Nearest square below34,969
Nearest square above35,344

Powers & multiples

35,111 to the power 21,232,782,321
35,111 to the power 343,284,220,072,631
35,111 to the power 41,519,752,250,970,147,041
35,111 to the power 553,360,021,283,812,832,756,551
First ten multiples35,111, 70,222, 105,333, 140,444, 175,555, 210,666, 245,777, 280,888, 315,999, 351,110
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time
Highest value reached266,6327× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps35,111 → 105,334 → 52,667 → 158,002 → 79,001 → 237,004 → 118,502 → 59,251 → 177,754 → 88,877 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,511,100%
35,111% as a decimal351.11
35,111% of 10035,111
35,111% of 1,000351,110
As a fraction of 10035,111/100

Read another way

As bytes34.288 KiB
As a 24-bit colour#008927

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