Recognised as Number

73,455

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value73,455

Digit count5

Digit sum24

Digit product2,100

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 59 × 83

Distinct prime factors43, 5, 59, 83

Number of divisors16

Sum of divisors σ(n)120,960

Aliquot sum47,505sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 59, 83, 177, 249, 295, 415, 885, 1,245, 4,897, 14,691, 24,485, 73,45516 in total

Arithmetic

Previous number73,454

Next number73,456

Double146,910

Half36,727.5

Square5,395,637,025

Cube396,336,517,671,375

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

Cube root41.880043203≈

Negation-73,455

Reciprocal0.0000136138≈

Representations

Decimal73,455

Binary1000111101110111117 bits

Octal217357

Hexadecimal11EEF

Base 361KOF

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

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

Ordinalseventy-three thousand, four hundred and fifty-fifth

Scientific notation7.3455 × 10^4

Engineering notation73.455 × 10^3

In other bases

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

Quinary4322310base 5; one hand: 7 digits

Septenary424104base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010001111011101111

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

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

At each machine width

32-bit00000000000000010001111011101111

64-bit0000000000000000000000000000000000000000000000010001111011101111

One's complement11111111111111101110000100010000at 32 bits, every bit flipped

Bits reversed11110111011110001000000000000000at 32 bits

Rotated left by 100000000000000100011110111011110at 32 bits, wrapping

Shifted left by 1100011110111011110= 146,910, no wrap

Shifted right by 11000111101110111= 36,727, discarding the low bit

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

Nearest landmarks

Next prime73,459+4

Previous prime73,453−2

Distance to nearest prime2

Nearest square below73,441

Nearest square above73,984

Powers & multiples

73,455 to the power 25,395,637,025

73,455 to the power 3396,336,517,671,375

73,455 to the power 429,112,898,905,550,850,625

73,455 to the power 52,138,487,989,107,237,732,659,375

First ten multiples73,455, 146,910, 220,365, 293,820, 367,275, 440,730, 514,185, 587,640, 661,095, 734,550

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 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 1125the total stopping time

Highest value reached1,882,60025× the starting value

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

First steps73,455 → 220,366 → 110,183 → 330,550 → 165,275 → 495,826 → 247,913 → 743,740 → 371,870 → 185,935 → …

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

As a percentage & fraction

As a percentage7,345,500%

73,455% as a decimal734.55

73,455% of 10073,455

73,455% of 1,000734,550

As a fraction of 10073,455/100

Read another way

As seconds20 hours, 24 minutes and 15 seconds

As bytes71.733 KiB

As a 24-bit colour#011EEF

Keep nerding

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