Nerdulator> put something in

Recognised as Number

93,067

  • Positive
  • Odd
  • Composite
  • 5 digits

93,067 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value93,067
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation13 × 7,159
Distinct prime factors213, 7,159
Number of divisors4
Sum of divisors σ(n)100,240
Aliquot sum7,173sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)85,896integers below n that share no factor with it
Carmichael function λ(n)14,316the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 85,896
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 7,159, 93,0674 in total

Arithmetic

Previous number93,066
Next number93,068
Double186,134
Square root305.068844689≈irrational, shown to 9 decimal places
Cube root45.317426416≈
Negation-93,067
Reciprocal0.0000107449≈

Representations

Decimal93,067
Binary1011010111000101117 bits
Octal265613
Hexadecimal16B8B
Base 361ZT7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-three thousand and sixty-seven
Ordinalninety-three thousand and sixty-seventh
Scientific notation9.3067 × 10^4
Engineering notation93.067 × 10^3

In other bases

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

Bit-level

00000000000000010110101110001011
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 6b 8b
Gray code11101111001001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110101110001011
64-bit0000000000000000000000000000000000000000000000010110101110001011
One's complement11111111111111101001010001110100at 32 bits, every bit flipped
Bits reversed11010001110101101000000000000000at 32 bits
Rotated left by 100000000000000101101011100010110at 32 bits, wrapping
Shifted left by 1101101011100010110= 186,134, no wrap
Shifted right by 11011010111000101= 46,533, discarding the low bit
These bits as a double4.59812075 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime93,077+10
Previous prime93,059−8
Distance to nearest prime8
Nearest square below93,025
Nearest square above93,636

Powers & multiples

93,067 to the power 28,661,466,489
93,067 to the power 3806,096,701,731,763
93,067 to the power 475,021,001,740,069,987,121
93,067 to the power 56,981,979,568,943,093,491,390,107
First ten multiples93,067, 186,134, 279,201, 372,268, 465,335, 558,402, 651,469, 744,536, 837,603, 930,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time
Highest value reached596,3206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps93,067 → 279,202 → 139,601 → 418,804 → 209,402 → 104,701 → 314,104 → 157,052 → 78,526 → 39,263 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,306,700%
93,067% as a decimal930.67
93,067% of 10093,067
93,067% of 1,000930,670
As a fraction of 10093,067/100

Read another way

As bytes90.886 KiB
As a 24-bit colour#016B8B

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