Recognised as Number

99,973

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value99,973

Digit count5

Digit sum37

Digit product15,309

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation257 × 389

Distinct prime factors2257, 389

Number of divisors4

Sum of divisors σ(n)100,620

Aliquot sum647sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)24,832the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 99,328

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

SquarefreeYesno repeated prime factor

All divisors1, 257, 389, 99,9734 in total

Arithmetic

Previous number99,972

Next number99,974

Double199,946

Half49,986.5

Square9,994,600,729

Cube999,190,218,680,317

Square root316.185072386≈irrational, shown to 9 decimal places

Cube root46.41171053≈

Negation-99,973

Reciprocal0.0000100027≈

Representations

Decimal99,973

Binary1100001101000010117 bits

Octal303205

Hexadecimal18685

Base 362551

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

In wordsninety-nine thousand, nine hundred and seventy-three

Ordinalninety-nine thousand, nine hundred and seventy-third

Scientific notation9.9973 × 10^4

Engineering notation99.973 × 10^3

In other bases

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

Quinary11144343base 5; one hand: 8 digits

Septenary564316base 7: 6 digits

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

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

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

Sexagesimal27:46:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000011000011010000101

Bit length17 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits10within that length

Bit parityodd7 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 86 85

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

At each machine width

32-bit00000000000000011000011010000101

64-bit0000000000000000000000000000000000000000000000011000011010000101

One's complement11111111111111100111100101111010at 32 bits, every bit flipped

Bits reversed10100001011000011000000000000000at 32 bits

Rotated left by 100000000000000110000110100001010at 32 bits, wrapping

Shifted left by 1110000110100001010= 199,946, no wrap

Shifted right by 11100001101000010= 49,986, discarding the low bit

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

Nearest landmarks

Next prime99,989+16

Previous prime99,971−2

Distance to nearest prime2

Nearest square below99,856

Nearest square above100,489

Powers & multiples

99,973 to the power 29,994,600,729

99,973 to the power 3999,190,218,680,317

99,973 to the power 499,892,043,732,127,331,441

99,973 to the power 59,986,507,288,031,965,706,151,093

First ten multiples99,973, 199,946, 299,919, 399,892, 499,865, 599,838, 699,811, 799,784, 899,757, 999,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 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 1

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 153the total stopping time

Highest value reached299,9203× the starting value

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

First steps99,973 → 299,920 → 149,960 → 74,980 → 37,490 → 18,745 → 56,236 → 28,118 → 14,059 → 42,178 → …

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

As a percentage & fraction

As a percentage9,997,300%

99,973% as a decimal999.73

99,973% of 10099,973

99,973% of 1,000999,730

As a fraction of 10099,973/100

Read another way

As seconds1 day, 3 hours and 46 minutes

As bytes97.63 KiB

As a 24-bit colour#018685

Keep nerding

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