Nerdulator> put something in

Recognised as Number

93,059

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value93,059
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation93,059
Distinct prime factors193,059
Number of divisors2
Sum of divisors σ(n)93,060
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)93,058integers below n that share no factor with it
Carmichael function λ(n)93,058the 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, 93,0592 in total

Arithmetic

Previous number93,058
Next number93,060
Double186,118
Square root305.055732613≈irrational, shown to 9 decimal places
Cube root45.31612789≈
Negation-93,059
Reciprocal0.0000107459≈

Representations

Decimal93,059
Binary1011010111000001117 bits
Octal265603
Hexadecimal16B83
Base 361ZSZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-three thousand and fifty-nine
Ordinalninety-three thousand and fifty-ninth
Scientific notation9.3059 × 10^4
Engineering notation93.059 × 10^3

In other bases

Ternary11201122122base 3; the most digit-efficient integer base after e: 11 digits
Quinary10434214base 5; one hand: 8 digits
Septenary535211base 7: 6 digits
Nonary151578base 9; each digit is two ternary digits: 6 digits
Duodecimal45a2bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalbccjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:50:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT1TT00T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011110010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010110101110000011
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 6b 83
Gray code11101111001000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110101110000011
64-bit0000000000000000000000000000000000000000000000010110101110000011
One's complement11111111111111101001010001111100at 32 bits, every bit flipped
Bits reversed11000001110101101000000000000000at 32 bits
Rotated left by 100000000000000101101011100000110at 32 bits, wrapping
Shifted left by 1101101011100000110= 186,118, no wrap
Shifted right by 11011010111000001= 46,529, discarding the low bit
These bits as a double4.59772549 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime93,077+18
Previous prime93,053−6
Distance to nearest prime0, it is prime
Nearest square below93,025
Nearest square above93,636

Powers & multiples

93,059 to the power 28,659,977,481
93,059 to the power 3805,888,844,404,379
93,059 to the power 474,995,209,971,427,105,361
93,059 to the power 56,978,979,244,731,034,997,789,299
First ten multiples93,059, 186,118, 279,177, 372,236, 465,295, 558,354, 651,413, 744,472, 837,531, 930,590
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time
Highest value reached418,7684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps93,059 → 279,178 → 139,589 → 418,768 → 209,384 → 104,692 → 52,346 → 26,173 → 78,520 → 39,260 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,305,900%
93,059% as a decimal930.59
93,059% of 10093,059
93,059% of 1,000930,590
As a fraction of 10093,059/100

Read another way

As bytes90.878 KiB
As a 24-bit colour#016B83

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