Nerdulator> put something in

Recognised as Number

93,553

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value93,553
Digit count5
Digit sum25
Digit product2,025
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

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

Arithmetic

Previous number93,552
Next number93,554
Double187,106
Square root305.864349018≈irrational, shown to 9 decimal places
Cube root45.396172706≈
Negation-93,553
Reciprocal0.0000106891≈

Representations

Decimal93,553
Binary1011011010111000117 bits
Octal266561
Hexadecimal16D71
Base 36206P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-three thousand, five hundred and fifty-three
Ordinalninety-three thousand, five hundred and fifty-third
Scientific notation9.3553 × 10^4
Engineering notation93.553 × 10^3

In other bases

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

Bit-level

00000000000000010110110101110001
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; 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 6d 71
Gray code11101101111001001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110110101110001
64-bit0000000000000000000000000000000000000000000000010110110101110001
One's complement11111111111111101001001010001110at 32 bits, every bit flipped
Bits reversed10001110101101101000000000000000at 32 bits
Rotated left by 100000000000000101101101011100010at 32 bits, wrapping
Shifted left by 1101101101011100010= 187,106, no wrap
Shifted right by 11011011010111000= 46,776, discarding the low bit
These bits as a double4.62213234 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime93,557+4
Previous prime93,529−24
Distance to nearest prime0, it is prime
Nearest square below93,025
Nearest square above93,636

Powers & multiples

93,553 to the power 28,752,163,809
93,553 to the power 3818,791,180,823,377
93,553 to the power 476,600,371,339,569,388,481
93,553 to the power 57,166,194,539,930,735,000,562,993
First ten multiples93,553, 187,106, 280,659, 374,212, 467,765, 561,318, 654,871, 748,424, 841,977, 935,530
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1146the total stopping time
Highest value reached280,6603× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps93,553 → 280,660 → 140,330 → 70,165 → 210,496 → 105,248 → 52,624 → 26,312 → 13,156 → 6,578 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,355,300%
93,553% as a decimal935.53
93,553% of 10093,553
93,553% of 1,000935,530
As a fraction of 10093,553/100

Read another way

As bytes91.36 KiB
As a 24-bit colour#016D71

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