Recognised as Number

96,567

Positive
Odd
Composite
5 digits

96,567 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value96,567

Digit count5

Digit sum33

Digit product11,340

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 32,189

Distinct prime factors23, 32,189

Number of divisors4

Sum of divisors σ(n)128,760

Aliquot sum32,193sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)32,188the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,376

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 32,189, 96,5674 in total

Arithmetic

Previous number96,566

Next number96,568

Double193,134

Half48,283.5

Square9,325,185,489

Cube900,505,187,116,263

Square root310.752312944≈irrational, shown to 9 decimal places

Cube root45.878539053≈

Negation-96,567

Reciprocal0.0000103555≈

Representations

Decimal96,567

Binary1011110010011011117 bits

Octal274467

Hexadecimal17937

Base 3622IF

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

In wordsninety-six thousand, five hundred and sixty-seven

Ordinalninety-six thousand, five hundred and sixty-seventh

Scientific notation9.6567 × 10^4

Engineering notation96.567 × 10^3

In other bases

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

Quinary11042232base 5; one hand: 8 digits

Septenary551352base 7: 6 digits

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

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

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

Sexagesimal26:49:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010111100100110111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 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 79 37

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

At each machine width

32-bit00000000000000010111100100110111

64-bit0000000000000000000000000000000000000000000000010111100100110111

One's complement11111111111111101000011011001000at 32 bits, every bit flipped

Bits reversed11101100100111101000000000000000at 32 bits

Rotated left by 100000000000000101111001001101110at 32 bits, wrapping

Shifted left by 1101111001001101110= 193,134, no wrap

Shifted right by 11011110010011011= 48,283, discarding the low bit

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

Nearest landmarks

Next prime96,581+14

Previous prime96,557−10

Distance to nearest prime10

Nearest square below96,100

Nearest square above96,721

Powers & multiples

96,567 to the power 29,325,185,489

96,567 to the power 3900,505,187,116,263

96,567 to the power 486,959,084,404,256,169,121

96,567 to the power 58,397,377,903,665,805,483,507,607

First ten multiples96,567, 193,134, 289,701, 386,268, 482,835, 579,402, 675,969, 772,536, 869,103, 965,670

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 197the total stopping time

Highest value reached651,8326× the starting value

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

First steps96,567 → 289,702 → 144,851 → 434,554 → 217,277 → 651,832 → 325,916 → 162,958 → 81,479 → 244,438 → …

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

As a percentage & fraction

As a percentage9,656,700%

96,567% as a decimal965.67

96,567% of 10096,567

96,567% of 1,000965,670

As a fraction of 10096,567/100

Read another way

As seconds1 day, 2 hours and 49 minutes

As bytes94.304 KiB

As a 24-bit colour#017937

Keep nerding

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