Nerdulator> put something in

Recognised as Number

89,473

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value89,473
Digit count5
Digit sum31
Digit product6,048
Multiplicative persistence2times 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 factorisation131 × 683
Distinct prime factors2131, 683
Number of divisors4
Sum of divisors σ(n)90,288
Aliquot sum815sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)88,660integers below n that share no factor with it
Carmichael function λ(n)44,330the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 88,660
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 131, 683, 89,4734 in total

Arithmetic

Previous number89,472
Next number89,474
Double178,946
Square root299.120377106≈irrational, shown to 9 decimal places
Cube root44.726405797≈
Negation-89,473
Reciprocal0.0000111766≈

Representations

Decimal89,473
Binary1010111011000000117 bits
Octal256601
Hexadecimal15D81
Base 361X1D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-nine thousand, four hundred and seventy-three
Ordinaleighty-nine thousand, four hundred and seventy-third
Scientific notation8.9473 × 10^4
Engineering notation89.473 × 10^3

In other bases

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

Bit-level

00000000000000010101110110000001
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 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 5d 81
Gray code11111001101000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010101110110000001
64-bit0000000000000000000000000000000000000000000000010101110110000001
One's complement11111111111111101010001001111110at 32 bits, every bit flipped
Bits reversed10000001101110101000000000000000at 32 bits
Rotated left by 100000000000000101011101100000010at 32 bits, wrapping
Shifted left by 1101011101100000010= 178,946, no wrap
Shifted right by 11010111011000000= 44,736, discarding the low bit
These bits as a double4.42055355 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime89,477+4
Previous prime89,459−14
Distance to nearest prime4
Nearest square below89,401
Nearest square above90,000

Powers & multiples

89,473 to the power 28,005,417,729
89,473 to the power 3716,268,740,466,817
89,473 to the power 464,086,713,015,787,517,441
89,473 to the power 55,734,030,473,661,556,547,998,593
First ten multiples89,473, 178,946, 268,419, 357,892, 447,365, 536,838, 626,311, 715,784, 805,257, 894,730
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 145the total stopping time
Highest value reached268,4203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps89,473 → 268,420 → 134,210 → 67,105 → 201,316 → 100,658 → 50,329 → 150,988 → 75,494 → 37,747 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage8,947,300%
89,473% as a decimal894.73
89,473% of 10089,473
89,473% of 1,000894,730
As a fraction of 10089,473/100

Read another way

As bytes87.376 KiB
As a 24-bit colour#015D81

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