Recognised as Number

73,457

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value73,457

Digit count5

Digit sum26

Digit product2,940

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 29 × 149

Distinct prime factors317, 29, 149

Number of divisors8

Sum of divisors σ(n)81,000

Aliquot sum7,543sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,144the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 66,304

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

SquarefreeYesno repeated prime factor

All divisors1, 17, 29, 149, 493, 2,533, 4,321, 73,4578 in total

Arithmetic

Previous number73,456

Next number73,458

Double146,914

Half36,728.5

Square5,395,930,849

Cube396,368,892,374,993

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

Cube root41.880423297≈

Negation-73,457

Reciprocal0.0000136134≈

Representations

Decimal73,457

Binary1000111101111000117 bits

Octal217361

Hexadecimal11EF1

Base 361KOH

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

In wordsseventy-three thousand, four hundred and fifty-seven

Ordinalseventy-three thousand, four hundred and fifty-seventh

Scientific notation7.3457 × 10^4

Engineering notation73.457 × 10^3

In other bases

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

Quinary4322312base 5; one hand: 7 digits

Septenary424106base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010001111011110001

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 1e f1

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

At each machine width

32-bit00000000000000010001111011110001

64-bit0000000000000000000000000000000000000000000000010001111011110001

One's complement11111111111111101110000100001110at 32 bits, every bit flipped

Bits reversed10001111011110001000000000000000at 32 bits

Rotated left by 100000000000000100011110111100010at 32 bits, wrapping

Shifted left by 1100011110111100010= 146,914, no wrap

Shifted right by 11000111101111000= 36,728, discarding the low bit

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

Nearest landmarks

Next prime73,459+2

Previous prime73,453−4

Distance to nearest prime2

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,457 to the power 25,395,930,849

73,457 to the power 3396,368,892,374,993

73,457 to the power 429,116,069,727,189,860,801

73,457 to the power 52,138,779,133,950,185,604,859,057

First ten multiples73,457, 146,914, 220,371, 293,828, 367,285, 440,742, 514,199, 587,656, 661,113, 734,570

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 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached220,3723× the starting value

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

First steps73,457 → 220,372 → 110,186 → 55,093 → 165,280 → 82,640 → 41,320 → 20,660 → 10,330 → 5,165 → …

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

As a percentage & fraction

As a percentage7,345,700%

73,457% as a decimal734.57

73,457% of 10073,457

73,457% of 1,000734,570

As a fraction of 10073,457/100

Read another way

As seconds20 hours, 24 minutes and 17 seconds

As bytes71.735 KiB

As a 24-bit colour#011EF1

Keep nerding

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