Recognised as Number
74,137
- Positive
- Odd
- Composite
- 5 digits
74,137 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value74,137
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 factorisation7^2 × 17 × 89
Distinct prime factors37, 17, 89
Number of divisors12
Sum of divisors σ(n)92,340
Aliquot sum18,203sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)59,136integers below n that share no factor with it
Carmichael function λ(n)3,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 59,136
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 17, 49, 89, 119, 623, 833, 1,513, 4,361, 10,591, 74,13712 in total
Arithmetic
Representations
Decimal74,137
Binary1001000011001100117 bits
Octal220631
Hexadecimal12199
Base 361L7D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-four thousand, one hundred and thirty-seven
Ordinalseventy-four thousand, one hundred and thirty-seventh
Scientific notation7.4137 × 10^4
Engineering notation74.137 × 10^3
In other bases
Ternary10202200211base 3; the most digit-efficient integer base after e: 11 digits
Quinary4333022base 5; one hand: 7 digits
Septenary426100base 7: 6 digits
Nonary122624base 9; each digit is two ternary digits: 6 digits
Duodecimal36aa1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal956hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:35:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T10T01T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010000110011001
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 21 99
Gray code11011000101010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010000110011001
64-bit0000000000000000000000000000000000000000000000010010000110011001
One's complement11111111111111101101111001100110at 32 bits, every bit flipped
Bits reversed10011001100001001000000000000000at 32 bits
Rotated left by 100000000000000100100001100110010at 32 bits, wrapping
Shifted left by 1100100001100110010= 148,274, no wrap
Shifted right by 11001000011001100= 37,068, discarding the low bit
These bits as a double3.66285448 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
74,137 to the power 25,496,294,769
74,137 to the power 3407,478,805,289,353
74,137 to the power 430,209,256,187,736,763,361
74,137 to the power 52,239,623,625,990,240,425,294,457
First ten multiples74,137, 148,274, 222,411, 296,548, 370,685, 444,822, 518,959, 593,096, 667,233, 741,370
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 150the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps74,137 → 222,412 → 111,206 → 55,603 → 166,810 → 83,405 → 250,216 → 125,108 → 62,554 → 31,277 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,413,700%
74,137% as a decimal741.37
74,137% of 10074,137
74,137% of 1,000741,370
As a fraction of 10074,137/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 74,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page