Recognised as Number
74,097
- Positive
- Odd
- Composite
- 5 digits
74,097 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value74,097
Digit count5
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 8,233
Distinct prime factors23, 8,233
Number of divisors6
Sum of divisors σ(n)107,042
Aliquot sum32,945sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)49,392integers below n that share no factor with it
Carmichael function λ(n)8,232the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 49,392
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 8,233, 24,699, 74,0976 in total
Arithmetic
Representations
Decimal74,097
Binary1001000010111000117 bits
Octal220561
Hexadecimal12171
Base 361L69
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-four thousand and ninety-seven
Ordinalseventy-four thousand and ninety-seventh
Scientific notation7.4097 × 10^4
Engineering notation74.097 × 10^3
In other bases
Ternary10202122100base 3; the most digit-efficient integer base after e: 11 digits
Quinary4332342base 5; one hand: 7 digits
Septenary426012base 7: 6 digits
Nonary122570base 9; each digit is two ternary digits: 6 digits
Duodecimal36a69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal954hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:34:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T10T0T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011010110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010000101110001
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 71
Gray code11011000111001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010000101110001
64-bit0000000000000000000000000000000000000000000000010010000101110001
One's complement11111111111111101101111010001110at 32 bits, every bit flipped
Bits reversed10001110100001001000000000000000at 32 bits
Rotated left by 100000000000000100100001011100010at 32 bits, wrapping
Shifted left by 1100100001011100010= 148,194, no wrap
Shifted right by 11001000010111000= 37,048, discarding the low bit
These bits as a double3.66087822 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
74,097 to the power 25,490,365,409
74,097 to the power 3406,819,605,710,673
74,097 to the power 430,144,112,324,343,737,281
74,097 to the power 52,233,588,290,896,897,901,310,257
First ten multiples74,097, 148,194, 222,291, 296,388, 370,485, 444,582, 518,679, 592,776, 666,873, 740,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps74,097 → 222,292 → 111,146 → 55,573 → 166,720 → 83,360 → 41,680 → 20,840 → 10,420 → 5,210 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,409,700%
74,097% as a decimal740.97
74,097% of 10074,097
74,097% of 1,000740,970
As a fraction of 10074,097/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,097
Nerdulate something else
Nothing in mind? Surprise me · today’s page