Recognised as Number

73,571

Positive
Odd
Prime
5 digits

73,571 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value73,571

Digit count5

Digit sum23

Digit product735

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation73,571

Distinct prime factors173,571

Number of divisors2

Sum of divisors σ(n)73,572

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)73,570the 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,5712 in total

Arithmetic

Previous number73,570

Next number73,572

Double147,142

Half36,785.5

Square5,412,692,041

Cube398,217,166,148,411

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

Cube root41.902077238≈

Negation-73,571

Reciprocal0.0000135923≈

Representations

Decimal73,571

Binary1000111110110001117 bits

Octal217543

Hexadecimal11F63

Base 361KRN

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

In wordsseventy-three thousand, five hundred and seventy-one

Ordinalseventy-three thousand, five hundred and seventy-first

Scientific notation7.3571 × 10^4

Engineering notation73.571 × 10^3

In other bases

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

Quinary4323241base 5; one hand: 7 digits

Septenary424331base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010001111101100011

Bit length17 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits7within that length

Bit parityeven10 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 63

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

At each machine width

32-bit00000000000000010001111101100011

64-bit0000000000000000000000000000000000000000000000010001111101100011

One's complement11111111111111101110000010011100at 32 bits, every bit flipped

Bits reversed11000110111110001000000000000000at 32 bits

Rotated left by 100000000000000100011111011000110at 32 bits, wrapping

Shifted left by 1100011111011000110= 147,142, no wrap

Shifted right by 11000111110110001= 36,785, discarding the low bit

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

Nearest landmarks

Next prime73,583+12

Previous prime73,561−10

Distance to nearest prime0, it is prime

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,571 to the power 25,412,692,041

73,571 to the power 3398,217,166,148,411

73,571 to the power 429,297,235,130,704,745,681

73,571 to the power 52,155,426,885,801,078,844,496,851

First ten multiples73,571, 147,142, 220,713, 294,284, 367,855, 441,426, 514,997, 588,568, 662,139, 735,710

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 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1112the total stopping time

Highest value reached331,0724× the starting value

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

First steps73,571 → 220,714 → 110,357 → 331,072 → 165,536 → 82,768 → 41,384 → 20,692 → 10,346 → 5,173 → …

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

As a percentage & fraction

As a percentage7,357,100%

73,571% as a decimal735.71

73,571% of 10073,571

73,571% of 1,000735,710

As a fraction of 10073,571/100

Read another way

As seconds20 hours, 26 minutes and 11 seconds

As bytes71.847 KiB

As a 24-bit colour#011F63

Keep nerding

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