Recognised as Number
73,454
- Positive
- Even
- Composite
- 5 digits
73,454 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value73,454
Digit count5
Digit sum23
Digit product1,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 19 × 1,933
Distinct prime factors32, 19, 1,933
Number of divisors8
Sum of divisors σ(n)116,040
Aliquot sum42,586sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)34,776integers below n that share no factor with it
Carmichael function λ(n)5,796the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 34,776
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 19, 38, 1,933, 3,866, 36,727, 73,4548 in total
Arithmetic
Representations
Decimal73,454
Binary1000111101110111017 bits
Octal217356
Hexadecimal11EEE
Base 361KOE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-three thousand, four hundred and fifty-four
Ordinalseventy-three thousand, four hundred and fifty-fourth
Scientific notation7.3454 × 10^4
Engineering notation73.454 × 10^3
In other bases
Ternary10201202112base 3; the most digit-efficient integer base after e: 11 digits
Quinary4322304base 5; one hand: 7 digits
Septenary424103base 7: 6 digits
Nonary121675base 9; each digit is two ternary digits: 6 digits
Duodecimal36612base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal93cebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:24:14base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1TT10TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001100110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001111011101110
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 1e ee
Gray code11001000110011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001111011101110
64-bit0000000000000000000000000000000000000000000000010001111011101110
One's complement11111111111111101110000100010001at 32 bits, every bit flipped
Bits reversed01110111011110001000000000000000at 32 bits
Rotated left by 100000000000000100011110111011100at 32 bits, wrapping
Shifted left by 1100011110111011100= 146,908, no wrap
Shifted right by 11000111101110111= 36,727, discarding the low bit
These bits as a double3.62910979 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
73,454 to the power 25,395,490,116
73,454 to the power 3396,320,330,980,664
73,454 to the power 429,111,313,591,853,693,456
73,454 to the power 52,138,342,428,576,021,199,117,024
First ten multiples73,454, 146,908, 220,362, 293,816, 367,270, 440,724, 514,178, 587,632, 661,086, 734,540
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 54
Collatz (3n + 1) trajectory
Steps to reach 163the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps73,454 → 36,727 → 110,182 → 55,091 → 165,274 → 82,637 → 247,912 → 123,956 → 61,978 → 30,989 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,345,400%
73,454% as a decimal734.54
73,454% of 10073,454
73,454% of 1,000734,540
As a fraction of 10073,454/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,454
Nerdulate something else
Nothing in mind? Surprise me · today’s page