Recognised as Number
3,604,685
- Positive
- Odd
- Composite
- 7 digits
3,604,685 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,685
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 factorisation5 × 7^2 × 14,713
Distinct prime factors35, 7, 14,713
Number of divisors12
Sum of divisors σ(n)5,032,188
Aliquot sum1,427,503sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,471,616integers below n that share no factor with it
Carmichael function λ(n)102,984the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,471,616
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 35, 49, 245, 14,713, 73,565, 102,991, 514,955, 720,937, 3,604,68512 in total
Arithmetic
Previous number3,604,684
Next number3,604,686
Double7,209,370
Half1,802,342.5
Square12,993,753,949,225
Cube46,838,389,954,462,119,125
Square root1,898.60080059≈irrational, shown to 9 decimal places
Cube root153.328342098≈
Negation-3,604,685
Reciprocal2.77416751 × 10^-7≈
Representations
Decimal3,604,685
Binary110111000000001100110122 bits
Octal15600315
Hexadecimal3700CD
Base 36259E5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand, six hundred and eighty-five
Ordinalthree million, six hundred and four thousand, six hundred and eighty-fifth
Scientific notation3.604685 × 10^6
Engineering notation3.604685 × 10^6
In other bases
Ternary20210010200212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410322220base 5; one hand: 10 digits
Septenary42432200base 7: 8 digits
Nonary6703625base 9; each digit is two ternary digits: 7 digits
Duodecimal125a065base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12abe5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:18:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10011T010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000000111011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000000011001101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; 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
Bytes337 00 cd
Gray code1011001000000010101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000000011001101
64-bit0000000000000000000000000000000000000000001101110000000011001101
One's complement11111111110010001111111100110010at 32 bits, every bit flipped
Bits reversed10110011000000001110110000000000at 32 bits
Rotated left by 100000000011011100000000110011010at 32 bits, wrapping
Shifted left by 111011100000000110011010= 7,209,370, no wrap
Shifted right by 1110111000000001100110= 1,802,342, discarding the low bit
These bits as a double1.78095102 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,685 to the power 212,993,753,949,225
3,604,685 to the power 346,838,389,954,462,119,125
3,604,685 to the power 4168,837,641,693,000,283,878,100,625
3,604,685 to the power 5608,606,514,446,132,728,291,131,151,428,125
First ten multiples3,604,685, 7,209,370, 10,814,055, 14,418,740, 18,023,425, 21,628,110, 25,232,795, 28,837,480, 32,442,165, 36,046,850
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 85
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached10,814,0563× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,685 → 10,814,056 → 5,407,028 → 2,703,514 → 1,351,757 → 4,055,272 → 2,027,636 → 1,013,818 → 506,909 → 1,520,728 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,468,500%
3,604,685% as a decimal36,046.85
3,604,685% of 1003,604,685
3,604,685% of 1,00036,046,850
As a fraction of 1003,604,685/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,604,685
Nerdulate something else
Nothing in mind? Surprise me · today’s page