Recognised as Number
3,604,048
- Positive
- Even
- Composite
- 7 digits
3,604,048 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,048
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 7^2 × 4,597
Distinct prime factors32, 7, 4,597
Number of divisors30
Sum of divisors σ(n)8,124,666
Aliquot sum4,520,618sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,544,256integers below n that share no factor with it
Carmichael function λ(n)32,172the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,544,256
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 28, 49, 56, 98, 112, 196, 392, 784, 4,597, 9,194, 18,388, 32,179, 36,776, 64,358, 73,552, 128,716, 225,253, 257,432, 450,506, 514,864, 901,012, 1,802,024, 3,604,04830 in total
Arithmetic
Previous number3,604,047
Next number3,604,049
Double7,208,096
Half1,802,024
Square12,989,161,986,304
Cube46,813,563,278,414,958,592
Square root1,898.433038061≈irrational, shown to 9 decimal places
Cube root153.319309787≈
Negation-3,604,048
Reciprocal2.77465783 × 10^-7≈
Representations
Decimal3,604,048
Binary110110111111100101000022 bits
Octal15577120
Hexadecimal36FE50
Base 36258WG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand and forty-eight
Ordinalthree million, six hundred and four thousand and forty-eighth
Scientific notation3.604048 × 10^6
Engineering notation3.604048 × 10^6
In other bases
Ternary20210002211021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410312143base 5; one hand: 10 digits
Septenary42430300base 7: 8 digits
Nonary6702737base 9; each digit is two ternary digits: 7 digits
Duodecimal1259814base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12aa28base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:7:28base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10010T111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000001001010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101111111001010000
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes336 fe 50
Gray code1011011000000101111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101111111001010000
64-bit0000000000000000000000000000000000000000001101101111111001010000
One's complement11111111110010010000000110101111at 32 bits, every bit flipped
Bits reversed00001010011111110110110000000000at 32 bits
Rotated left by 100000000011011011111110010100000at 32 bits, wrapping
Shifted left by 111011011111110010100000= 7,208,096, no wrap
Shifted right by 1110110111111100101000= 1,802,024, discarding the low bit
These bits as a double1.7806363 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,048 to the power 212,989,161,986,304
3,604,048 to the power 346,813,563,278,414,958,592
3,604,048 to the power 4168,718,329,106,444,874,683,580,416
3,604,048 to the power 5608,068,956,579,424,437,713,608,631,123,968
First ten multiples3,604,048, 7,208,096, 10,812,144, 14,416,192, 18,020,240, 21,624,288, 25,228,336, 28,832,384, 32,436,432, 36,040,480
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 4
Divisible by 100No, remainder 48
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached3,604,048
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,048 → 1,802,024 → 901,012 → 450,506 → 225,253 → 675,760 → 337,880 → 168,940 → 84,470 → 42,235 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,404,800%
3,604,048% as a decimal36,040.48
3,604,048% of 1003,604,048
3,604,048% of 1,00036,040,480
As a fraction of 1003,604,048/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,048
Nerdulate something else
Nothing in mind? Surprise me · today’s page