Recognised as Number

73,569

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value73,569

Digit count5

Digit sum30

Digit product5,670

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 137 × 179

Distinct prime factors33, 137, 179

Number of divisors8

Sum of divisors σ(n)99,360

Aliquot sum25,791sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,104the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,416

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 137, 179, 411, 537, 24,523, 73,5698 in total

Arithmetic

Previous number73,568

Next number73,570

Double147,138

Half36,784.5

Square5,412,397,761

Cube398,184,690,879,009

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

Cube root41.901697537≈

Negation-73,569

Reciprocal0.0000135927≈

Representations

Decimal73,569

Binary1000111110110000117 bits

Octal217541

Hexadecimal11F61

Base 361KRL

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

In wordsseventy-three thousand, five hundred and sixty-nine

Ordinalseventy-three thousand, five hundred and sixty-ninth

Scientific notation7.3569 × 10^4

Engineering notation73.569 × 10^3

In other bases

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

Quinary4323234base 5; one hand: 7 digits

Septenary424326base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010001111101100001

Bit length17 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits8within that length

Bit parityodd9 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 1f 61

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

At each machine width

32-bit00000000000000010001111101100001

64-bit0000000000000000000000000000000000000000000000010001111101100001

One's complement11111111111111101110000010011110at 32 bits, every bit flipped

Bits reversed10000110111110001000000000000000at 32 bits

Rotated left by 100000000000000100011111011000010at 32 bits, wrapping

Shifted left by 1100011111011000010= 147,138, no wrap

Shifted right by 11000111110110000= 36,784, discarding the low bit

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

Nearest landmarks

Next prime73,571+2

Previous prime73,561−8

Distance to nearest prime2

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,569 to the power 25,412,397,761

73,569 to the power 3398,184,690,879,009

73,569 to the power 429,294,049,523,277,813,121

73,569 to the power 52,155,133,929,378,025,433,498,849

First ten multiples73,569, 147,138, 220,707, 294,276, 367,845, 441,414, 514,983, 588,552, 662,121, 735,690

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 194the total stopping time

Highest value reached314,2604× the starting value

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

First steps73,569 → 220,708 → 110,354 → 55,177 → 165,532 → 82,766 → 41,383 → 124,150 → 62,075 → 186,226 → …

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

As a percentage & fraction

As a percentage7,356,900%

73,569% as a decimal735.69

73,569% of 10073,569

73,569% of 1,000735,690

As a fraction of 10073,569/100

Read another way

As seconds20 hours, 26 minutes and 9 seconds

As bytes71.845 KiB

As a 24-bit colour#011F61

Keep nerding

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