Recognised as Number
3,603,404
- Positive
- Even
- Composite
- 7 digits
3,603,404 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,603,404
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 7 × 128,693
Distinct prime factors32, 7, 128,693
Number of divisors12
Sum of divisors σ(n)7,206,864
Aliquot sum3,603,460sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,544,304integers below n that share no factor with it
Carmichael function λ(n)386,076the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,544,304
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 28, 128,693, 257,386, 514,772, 900,851, 1,801,702, 3,603,40412 in total
Arithmetic
Previous number3,603,403
Next number3,603,405
Double7,206,808
Half1,801,702
Square12,984,520,387,216
Cube46,788,472,701,375,683,264
Square root1,898.263416916≈irrational, shown to 9 decimal places
Cube root153.310177137≈
Negation-3,603,404
Reciprocal2.77515372 × 10^-7≈
Representations
Decimal3,603,404
Binary110110111110111100110022 bits
Octal15575714
Hexadecimal36FBCC
Base 36258EK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and three thousand, four hundred and four
Ordinalthree million, six hundred and three thousand, four hundred and fourth
Scientific notation3.603404 × 10^6
Engineering notation3.603404 × 10^6
In other bases
Ternary20210001221102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410302104base 5; one hand: 10 digits
Septenary42425360base 7: 8 digits
Nonary6701842base 9; each digit is two ternary digits: 7 digits
Duodecimal1259378base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12a8a4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:40:56:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1001T0T111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000110011011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101111101111001100
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes336 fb cc
Gray code1011011000011000101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101111101111001100
64-bit0000000000000000000000000000000000000000001101101111101111001100
One's complement11111111110010010000010000110011at 32 bits, every bit flipped
Bits reversed00110011110111110110110000000000at 32 bits
Rotated left by 100000000011011011111011110011000at 32 bits, wrapping
Shifted left by 111011011111011110011000= 7,206,808, no wrap
Shifted right by 1110110111110111100110= 1,801,702, discarding the low bit
These bits as a double1.78031812 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,603,404 to the power 212,984,520,387,216
3,603,404 to the power 346,788,472,701,375,683,264
3,603,404 to the power 4168,597,769,686,027,942,576,230,656
3,603,404 to the power 5607,525,877,677,711,832,390,959,850,753,024
First ten multiples3,603,404, 7,206,808, 10,810,212, 14,413,616, 18,017,020, 21,620,424, 25,223,828, 28,827,232, 32,430,636, 36,034,040
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached4,053,8321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,603,404 → 1,801,702 → 900,851 → 2,702,554 → 1,351,277 → 4,053,832 → 2,026,916 → 1,013,458 → 506,729 → 1,520,188 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,340,400%
3,603,404% as a decimal36,034.04
3,603,404% of 1003,603,404
3,603,404% of 1,00036,034,040
As a fraction of 1003,603,404/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,603,404
Nerdulate something else
Nothing in mind? Surprise me · today’s page