Recognised as Number
73,709
- Positive
- Odd
- Prime
- 5 digits
73,709 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value73,709
Digit count5
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation73,709
Distinct prime factors173,709
Number of divisors2
Sum of divisors σ(n)73,710
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)73,708integers below n that share no factor with it
Carmichael function λ(n)73,708the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 73,7092 in total
Arithmetic
Representations
Decimal73,709
Binary1000111111110110117 bits
Octal217755
Hexadecimal11FED
Base 361KVH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-three thousand, seven hundred and nine
Ordinalseventy-three thousand, seven hundred and ninth
Scientific notation7.3709 × 10^4
Engineering notation73.709 × 10^3
In other bases
Ternary10202002222base 3; the most digit-efficient integer base after e: 11 digits
Quinary4324314base 5; one hand: 7 digits
Septenary424616base 7: 6 digits
Nonary122088base 9; each digit is two ternary digits: 6 digits
Duodecimal367a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9459base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:28:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1T01000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000000111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001111111101101
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 ed
Gray code11001000000011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001111111101101
64-bit0000000000000000000000000000000000000000000000010001111111101101
One's complement11111111111111101110000000010010at 32 bits, every bit flipped
Bits reversed10110111111110001000000000000000at 32 bits
Rotated left by 100000000000000100011111111011010at 32 bits, wrapping
Shifted left by 1100011111111011010= 147,418, no wrap
Shifted right by 11000111111110110= 36,854, discarding the low bit
These bits as a double3.64170847 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
73,709 to the power 25,433,016,681
73,709 to the power 3400,462,226,539,829
73,709 to the power 429,517,670,256,024,255,761
73,709 to the power 52,175,717,956,901,291,867,887,549
First ten multiples73,709, 147,418, 221,127, 294,836, 368,545, 442,254, 515,963, 589,672, 663,381, 737,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1169the total stopping time
Highest value reached1,702,27623× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps73,709 → 221,128 → 110,564 → 55,282 → 27,641 → 82,924 → 41,462 → 20,731 → 62,194 → 31,097 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,370,900%
73,709% as a decimal737.09
73,709% of 10073,709
73,709% of 1,000737,090
As a fraction of 10073,709/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 73,709
Nerdulate something else
Nothing in mind? Surprise me · today’s page