Recognised as Number

73,690

Positive
Even
Composite
5 digits

73,690 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value73,690

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 factorisation2 × 5 × 7,369

Distinct prime factors32, 5, 7,369

Number of divisors8

Sum of divisors σ(n)132,660

Aliquot sum58,970sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,368the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,472

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 7,369, 14,738, 36,845, 73,6908 in total

Arithmetic

Previous number73,689

Next number73,691

Double147,380

Half36,845

Square5,430,216,100

Cube400,152,624,409,000

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

Cube root41.924657064≈

Negation-73,690

Reciprocal0.0000135704≈

Representations

Decimal73,690

Binary1000111111101101017 bits

Octal217732

Hexadecimal11FDA

Base 361KUY

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

In wordsseventy-three thousand, six hundred and ninety

Ordinalseventy-three thousand, six hundred and ninetieth

Scientific notation7.369 × 10^4

Engineering notation73.69 × 10^3

In other bases

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

Quinary4324230base 5; one hand: 7 digits

Septenary424561base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010001111111011010

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 even

Highest set bitbit 16worth 65,536

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes301 1f da

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

At each machine width

32-bit00000000000000010001111111011010

64-bit0000000000000000000000000000000000000000000000010001111111011010

One's complement11111111111111101110000000100101at 32 bits, every bit flipped

Bits reversed01011011111110001000000000000000at 32 bits

Rotated left by 100000000000000100011111110110100at 32 bits, wrapping

Shifted left by 1100011111110110100= 147,380, no wrap

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

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

Nearest landmarks

Next prime73,693+3

Previous prime73,681−9

Distance to nearest prime3

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,690 to the power 25,430,216,100

73,690 to the power 3400,152,624,409,000

73,690 to the power 429,487,246,892,699,210,000

73,690 to the power 52,172,915,223,523,004,784,900,000

First ten multiples73,690, 147,380, 221,070, 294,760, 368,450, 442,140, 515,830, 589,520, 663,210, 736,900

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 10

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1125the total stopping time

Highest value reached110,5361× the starting value

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

First steps73,690 → 36,845 → 110,536 → 55,268 → 27,634 → 13,817 → 41,452 → 20,726 → 10,363 → 31,090 → …

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

As a percentage & fraction

As a percentage7,369,000%

73,690% as a decimal736.9

73,690% of 10073,690

73,690% of 1,000736,900

As a fraction of 10073,690/100

Read another way

As seconds20 hours, 28 minutes and 10 seconds

As bytes71.963 KiB

As a 24-bit colour#011FDA

Keep nerding

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