Recognised as Number
71,734
- Positive
- Even
- Composite
- 5 digits
71,734 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value71,734
Digit count5
Digit sum22
Digit product588
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 13 × 31 × 89
Distinct prime factors42, 13, 31, 89
Number of divisors16
Sum of divisors σ(n)120,960
Aliquot sum49,226sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)31,680integers below n that share no factor with it
Carmichael function λ(n)1,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,680
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 26, 31, 62, 89, 178, 403, 806, 1,157, 2,314, 2,759, 5,518, 35,867, 71,73416 in total
Arithmetic
Representations
Decimal71,734
Binary1000110000011011017 bits
Octal214066
Hexadecimal11836
Base 361JCM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-one thousand, seven hundred and thirty-four
Ordinalseventy-one thousand, seven hundred and thirty-fourth
Scientific notation7.1734 × 10^4
Engineering notation71.734 × 10^3
In other bases
Ternary10122101211base 3; the most digit-efficient integer base after e: 11 digits
Quinary4243414base 5; one hand: 7 digits
Septenary416065base 7: 6 digits
Nonary118354base 9; each digit is two ternary digits: 6 digits
Duodecimal3561abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8j6ebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal19:55:34base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T0T11TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110100001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010001100000110110
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 18 36
Gray code11001010000101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010001100000110110
64-bit0000000000000000000000000000000000000000000000010001100000110110
One's complement11111111111111101110011111001001at 32 bits, every bit flipped
Bits reversed01101100000110001000000000000000at 32 bits
Rotated left by 100000000000000100011000001101100at 32 bits, wrapping
Shifted left by 1100011000001101100= 143,468, no wrap
Shifted right by 11000110000011011= 35,867, discarding the low bit
These bits as a double3.5441305 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
71,734 to the power 25,145,766,756
71,734 to the power 3369,126,432,474,904
71,734 to the power 426,478,915,507,154,763,536
71,734 to the power 51,899,438,524,990,239,807,491,424
First ten multiples71,734, 143,468, 215,202, 286,936, 358,670, 430,404, 502,138, 573,872, 645,606, 717,340
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 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 34
Collatz (3n + 1) trajectory
Steps to reach 1174the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps71,734 → 35,867 → 107,602 → 53,801 → 161,404 → 80,702 → 40,351 → 121,054 → 60,527 → 181,582 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,173,400%
71,734% as a decimal717.34
71,734% of 10071,734
71,734% of 1,000717,340
As a fraction of 10071,734/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 71,734
Nerdulate something else
Nothing in mind? Surprise me · today’s page