Recognised as Number
3,707,609
- Positive
- Odd
- Composite
- 7 digits
3,707,609 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,707,609
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation101 × 36,709
Distinct prime factors2101, 36,709
Number of divisors4
Sum of divisors σ(n)3,744,420
Aliquot sum36,811sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,670,800integers below n that share no factor with it
Carmichael function λ(n)917,700the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,670,800
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 101, 36,709, 3,707,6094 in total
Arithmetic
Previous number3,707,608
Next number3,707,610
Double7,415,218
Half1,853,804.5
Square13,746,364,496,881
Cube50,966,144,725,916,467,529
Square root1,925.515255717≈irrational, shown to 9 decimal places
Cube root154.773989024≈
Negation-3,707,609
Reciprocal2.69715604 × 10^-7≈
Representations
Decimal3,707,609
Binary111000100100101101100122 bits
Octal16111331
Hexadecimal3892D9
Base 3627GT5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, seven hundred and seven thousand, six hundred and nine
Ordinalthree million, seven hundred and seven thousand, six hundred and ninth
Scientific notation3.707609 × 10^6
Engineering notation3.707609 × 10^6
In other bases
Ternary20222100212212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1422120414base 5; one hand: 10 digits
Septenary43341233base 7: 8 digits
Nonary6870785base 9; each digit is two ternary digits: 7 digits
Duodecimal12a9735base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal133909base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:9:53:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T100T1010T00TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010011001011100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110001001001011011001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes338 92 d9
Gray code1001001101101110110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110001001001011011001
64-bit0000000000000000000000000000000000000000001110001001001011011001
One's complement11111111110001110110110100100110at 32 bits, every bit flipped
Bits reversed10011011010010010001110000000000at 32 bits
Rotated left by 100000000011100010010010110110010at 32 bits, wrapping
Shifted left by 111100010010010110110010= 7,415,218, no wrap
Shifted right by 1111000100100101101100= 1,853,804, discarding the low bit
These bits as a double1.83180224 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,707,609 to the power 213,746,364,496,881
3,707,609 to the power 350,966,144,725,916,467,529
3,707,609 to the power 4188,962,536,881,110,428,258,728,161
3,707,609 to the power 5700,599,202,403,236,953,805,914,858,277,049
First ten multiples3,707,609, 7,415,218, 11,122,827, 14,830,436, 18,538,045, 22,245,654, 25,953,263, 29,660,872, 33,368,481, 37,076,090
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1234the total stopping time
Highest value reached12,513,1843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,707,609 → 11,122,828 → 5,561,414 → 2,780,707 → 8,342,122 → 4,171,061 → 12,513,184 → 6,256,592 → 3,128,296 → 1,564,148 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage370,760,900%
3,707,609% as a decimal37,076.09
3,707,609% of 1003,707,609
3,707,609% of 1,00037,076,090
As a fraction of 1003,707,609/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 3,707,609
Nerdulate something else
Nothing in mind? Surprise me · today’s page