Recognised as Number

73,691

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value73,691

Digit count5

Digit sum26

Digit product1,134

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation59 × 1,249

Distinct prime factors259, 1,249

Number of divisors4

Sum of divisors σ(n)75,000

Aliquot sum1,309sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)36,192the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 72,384

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

SquarefreeYesno repeated prime factor

All divisors1, 59, 1,249, 73,6914 in total

Arithmetic

Previous number73,690

Next number73,692

Double147,382

Half36,845.5

Square5,430,363,481

Cube400,168,915,278,371

Square root271.460862741≈irrational, shown to 9 decimal places

Cube root41.924846707≈

Negation-73,691

Reciprocal0.0000135702≈

Representations

Decimal73,691

Binary1000111111101101117 bits

Octal217733

Hexadecimal11FDB

Base 361KUZ

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

In wordsseventy-three thousand, six hundred and ninety-one

Ordinalseventy-three thousand, six hundred and ninety-first

Scientific notation7.3691 × 10^4

Engineering notation73.691 × 10^3

In other bases

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

Quinary4324231base 5; one hand: 7 digits

Septenary424562base 7: 6 digits

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

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

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

Sexagesimal20:28:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010001111111011011

Bit length17 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits5within that length

Bit parityeven12 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 1f db

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

At each machine width

32-bit00000000000000010001111111011011

64-bit0000000000000000000000000000000000000000000000010001111111011011

One's complement11111111111111101110000000100100at 32 bits, every bit flipped

Bits reversed11011011111110001000000000000000at 32 bits

Rotated left by 100000000000000100011111110110110at 32 bits, wrapping

Shifted left by 1100011111110110110= 147,382, no wrap

Shifted right by 11000111111101101= 36,845, discarding the low bit

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

Nearest landmarks

Next prime73,693+2

Previous prime73,681−10

Distance to nearest prime2

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,691 to the power 25,430,363,481

73,691 to the power 3400,168,915,278,371

73,691 to the power 429,488,847,535,778,437,361

73,691 to the power 52,173,062,663,759,048,827,569,451

First ten multiples73,691, 147,382, 221,073, 294,764, 368,455, 442,146, 515,837, 589,528, 663,219, 736,910

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 11

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1125the total stopping time

Highest value reached3,025,34841× the starting value

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

First steps73,691 → 221,074 → 110,537 → 331,612 → 165,806 → 82,903 → 248,710 → 124,355 → 373,066 → 186,533 → …

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

As a percentage & fraction

As a percentage7,369,100%

73,691% as a decimal736.91

73,691% of 10073,691

73,691% of 1,000736,910

As a fraction of 10073,691/100

Read another way

As seconds20 hours, 28 minutes and 11 seconds

As bytes71.964 KiB

As a 24-bit colour#011FDB

Keep nerding

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