Recognised as Number
3,604,049
- Positive
- Odd
- Composite
- 7 digits
3,604,049 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,049
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation751 × 4,799
Distinct prime factors2751, 4,799
Number of divisors4
Sum of divisors σ(n)3,609,600
Aliquot sum5,551sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,598,500integers below n that share no factor with it
Carmichael function λ(n)1,799,250the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,598,500
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 751, 4,799, 3,604,0494 in total
Arithmetic
Previous number3,604,048
Next number3,604,050
Double7,208,098
Half1,802,024.5
Square12,989,169,194,401
Cube46,813,602,245,911,729,649
Square root1,898.433301436≈irrational, shown to 9 decimal places
Cube root153.319323967≈
Negation-3,604,049
Reciprocal2.77465706 × 10^-7≈
Representations
Decimal3,604,049
Binary110110111111100101000122 bits
Octal15577121
Hexadecimal36FE51
Base 36258WH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand and forty-nine
Ordinalthree million, six hundred and four thousand and forty-ninth
Scientific notation3.604049 × 10^6
Engineering notation3.604049 × 10^6
In other bases
Ternary20210002211022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410312144base 5; one hand: 10 digits
Septenary42430301base 7: 8 digits
Nonary6702738base 9; each digit is two ternary digits: 7 digits
Duodecimal1259815base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12aa29base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:7:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10010T1110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000001001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101111111001010001
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes336 fe 51
Gray code1011011000000101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101111111001010001
64-bit0000000000000000000000000000000000000000001101101111111001010001
One's complement11111111110010010000000110101110at 32 bits, every bit flipped
Bits reversed10001010011111110110110000000000at 32 bits
Rotated left by 100000000011011011111110010100010at 32 bits, wrapping
Shifted left by 111011011111110010100010= 7,208,098, no wrap
Shifted right by 1110110111111100101000= 1,802,024, discarding the low bit
These bits as a double1.7806368 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,049 to the power 212,989,169,194,401
3,604,049 to the power 346,813,602,245,911,729,649
3,604,049 to the power 4168,718,516,360,775,923,329,748,801
3,604,049 to the power 5608,069,800,171,538,105,700,657,836,495,249
First ten multiples3,604,049, 7,208,098, 10,812,147, 14,416,196, 18,020,245, 21,624,294, 25,228,343, 28,832,392, 32,436,441, 36,040,490
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached10,812,1483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,049 → 10,812,148 → 5,406,074 → 2,703,037 → 8,109,112 → 4,054,556 → 2,027,278 → 1,013,639 → 3,040,918 → 1,520,459 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,404,900%
3,604,049% as a decimal36,040.49
3,604,049% of 1003,604,049
3,604,049% of 1,00036,040,490
As a fraction of 1003,604,049/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,049
Nerdulate something else
Nothing in mind? Surprise me · today’s page