Recognised as Number
73,438
- Positive
- Even
- Composite
- 5 digits
73,438 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value73,438
Digit count5
Digit sum25
Digit product2,016
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 73 × 503
Distinct prime factors32, 73, 503
Number of divisors8
Sum of divisors σ(n)111,888
Aliquot sum38,450sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,144integers below n that share no factor with it
Carmichael function λ(n)18,072the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 36,144
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 73, 146, 503, 1,006, 36,719, 73,4388 in total
Arithmetic
Representations
Decimal73,438
Binary1000111101101111017 bits
Octal217336
Hexadecimal11EDE
Base 361KNY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-three thousand, four hundred and thirty-eight
Ordinalseventy-three thousand, four hundred and thirty-eighth
Scientific notation7.3438 × 10^4
Engineering notation73.438 × 10^3
In other bases
Ternary10201201221base 3; the most digit-efficient integer base after e: 11 digits
Quinary4322223base 5; one hand: 7 digits
Septenary424051base 7: 6 digits
Nonary121657base 9; each digit is two ternary digits: 6 digits
Duodecimal365babase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal93bibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:23:58base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T1TT1T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001100100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001111011011110
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 de
Gray code11001000110110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001111011011110
64-bit0000000000000000000000000000000000000000000000010001111011011110
One's complement11111111111111101110000100100001at 32 bits, every bit flipped
Bits reversed01111011011110001000000000000000at 32 bits
Rotated left by 100000000000000100011110110111100at 32 bits, wrapping
Shifted left by 1100011110110111100= 146,876, no wrap
Shifted right by 11000111101101111= 36,719, discarding the low bit
These bits as a double3.62831929 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
73,438 to the power 25,393,139,844
73,438 to the power 3396,061,403,863,672
73,438 to the power 429,085,957,376,940,344,336
73,438 to the power 52,136,014,537,847,745,007,347,168
First ten multiples73,438, 146,876, 220,314, 293,752, 367,190, 440,628, 514,066, 587,504, 660,942, 734,380
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1125the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps73,438 → 36,719 → 110,158 → 55,079 → 165,238 → 82,619 → 247,858 → 123,929 → 371,788 → 185,894 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,343,800%
73,438% as a decimal734.38
73,438% of 10073,438
73,438% of 1,000734,380
As a fraction of 10073,438/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,438
Nerdulate something else
Nothing in mind? Surprise me · today’s page