Recognised as Number
74,106
- Positive
- Even
- Composite
- 5 digits
74,106 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value74,106
Digit count5
Digit sum18
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 23 × 179
Distinct prime factors42, 3, 23, 179
Number of divisors24
Sum of divisors σ(n)168,480
Aliquot sum94,374sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)23,496integers below n that share no factor with it
Carmichael function λ(n)5,874the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,496
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 23, 46, 69, 138, 179, 207, 358, 414, 537, 1,074, 1,611, 3,222, 4,117, 8,234, 12,351, 24,702, 37,053, 74,10624 in total
Arithmetic
Representations
Decimal74,106
Binary1001000010111101017 bits
Octal220572
Hexadecimal1217A
Base 361L6I
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-four thousand, one hundred and six
Ordinalseventy-four thousand, one hundred and sixth
Scientific notation7.4106 × 10^4
Engineering notation74.106 × 10^3
In other bases
Ternary10202122200base 3; the most digit-efficient integer base after e: 11 digits
Quinary4332411base 5; one hand: 7 digits
Septenary426024base 7: 6 digits
Nonary122580base 9; each digit is two ternary digits: 6 digits
Duodecimal36a76base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9556base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal20:35:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary11T10T00T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110011010001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010000101111010
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; 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 21 7a
Gray code11011000111000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010000101111010
64-bit0000000000000000000000000000000000000000000000010010000101111010
One's complement11111111111111101101111010000101at 32 bits, every bit flipped
Bits reversed01011110100001001000000000000000at 32 bits
Rotated left by 100000000000000100100001011110100at 32 bits, wrapping
Shifted left by 1100100001011110100= 148,212, no wrap
Shifted right by 11001000010111101= 37,053, discarding the low bit
These bits as a double3.66132288 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
74,106 to the power 25,491,699,236
74,106 to the power 3406,967,863,583,016
74,106 to the power 430,158,760,498,682,983,696
74,106 to the power 52,234,945,105,515,401,189,775,776
First ten multiples74,106, 148,212, 222,318, 296,424, 370,530, 444,636, 518,742, 592,848, 666,954, 741,060
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 6
Collatz (3n + 1) trajectory
Steps to reach 1143the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps74,106 → 37,053 → 111,160 → 55,580 → 27,790 → 13,895 → 41,686 → 20,843 → 62,530 → 31,265 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,410,600%
74,106% as a decimal741.06
74,106% of 10074,106
74,106% of 1,000741,060
As a fraction of 10074,106/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,106
Nerdulate something else
Nothing in mind? Surprise me · today’s page