Recognised as Number

93,001

Positive
Odd
Prime
5 digits

93,001 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 value93,001

Digit count5

Digit sum13

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation93,001

Distinct prime factors193,001

Number of divisors2

Sum of divisors σ(n)93,002

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)93,000integers below n that share no factor with it

Carmichael function λ(n)93,000the 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,0012 in total

Arithmetic

Previous number93,000

Next number93,002

Double186,002

Half46,500.5

Square8,649,186,001

Cube804,382,947,279,001

Square root304.9606532≈irrational, shown to 9 decimal places

Cube root45.306711349≈

Negation-93,001

Reciprocal0.0000107526≈

Representations

Decimal93,001

Binary1011010110100100117 bits

Octal265511

Hexadecimal16B49

Base 361ZRD

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsninety-three thousand and one

Ordinalninety-three thousand and first

Scientific notation9.3001 × 10^4

Engineering notation93.001 × 10^3

In other bases

Ternary11201120111base 3; the most digit-efficient integer base after e: 11 digits

Quinary10434001base 5; one hand: 8 digits

Septenary535066base 7: 6 digits

Nonary151514base 9; each digit is two ternary digits: 6 digits

Duodecimal459a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalbca1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal25:50:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TTT1TTT0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101011111101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010110101101001001

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 49

Gray code11101111011101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110101101001001

64-bit0000000000000000000000000000000000000000000000010110101101001001

One's complement11111111111111101001010010110110at 32 bits, every bit flipped

Bits reversed10010010110101101000000000000000at 32 bits

Rotated left by 100000000000000101101011010010010at 32 bits, wrapping

Shifted left by 1101101011010010010= 186,002, no wrap

Shifted right by 11011010110100100= 46,500, discarding the low bit

These bits as a double4.59485991 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime93,047+46

Previous prime92,993−8

Distance to nearest prime0, it is prime

Nearest square below92,416

Nearest square above93,025

Powers & multiples

93,001 to the power 28,649,186,001

93,001 to the power 3804,382,947,279,001

93,001 to the power 474,808,418,479,894,372,001

93,001 to the power 56,957,257,727,048,656,490,465,001

First ten multiples93,001, 186,002, 279,003, 372,004, 465,005, 558,006, 651,007, 744,008, 837,009, 930,010

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time

Highest value reached470,8245× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps93,001 → 279,004 → 139,502 → 69,751 → 209,254 → 104,627 → 313,882 → 156,941 → 470,824 → 235,412 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,300,100%

93,001% as a decimal930.01

93,001% of 10093,001

93,001% of 1,000930,010

As a fraction of 10093,001/100

Read another way

As seconds1 day, 1 hour and 50 minutes

As bytes90.821 KiB

As a 24-bit colour#016B49

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.