Recognised as Number
3,604,047
- Positive
- Odd
- Composite
- 7 digits
3,604,047 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,047
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 277 × 4,337
Distinct prime factors33, 277, 4,337
Number of divisors8
Sum of divisors σ(n)4,823,856
Aliquot sum1,219,809sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,393,472integers below n that share no factor with it
Carmichael function λ(n)299,184the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,393,472
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 277, 831, 4,337, 13,011, 1,201,349, 3,604,0478 in total
Arithmetic
Previous number3,604,046
Next number3,604,048
Double7,208,094
Half1,802,023.5
Square12,989,154,778,209
Cube46,813,524,310,939,811,823
Square root1,898.432774685≈irrational, shown to 9 decimal places
Cube root153.319295606≈
Negation-3,604,047
Reciprocal2.7746586 × 10^-7≈
Representations
Decimal3,604,047
Binary110110111111100100111122 bits
Octal15577117
Hexadecimal36FE4F
Base 36258WF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand and forty-seven
Ordinalthree million, six hundred and four thousand and forty-seventh
Scientific notation3.604047 × 10^6
Engineering notation3.604047 × 10^6
In other bases
Ternary20210002211020base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410312142base 5; one hand: 10 digits
Septenary42430266base 7: 8 digits
Nonary6702736base 9; each digit is two ternary digits: 7 digits
Duodecimal1259813base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12aa27base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:7:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10010T111T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000001001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101111111001001111
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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 4f
Gray code1011011000000101101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101111111001001111
64-bit0000000000000000000000000000000000000000001101101111111001001111
One's complement11111111110010010000000110110000at 32 bits, every bit flipped
Bits reversed11110010011111110110110000000000at 32 bits
Rotated left by 100000000011011011111110010011110at 32 bits, wrapping
Shifted left by 111011011111110010011110= 7,208,094, no wrap
Shifted right by 1110110111111100100111= 1,802,023, discarding the low bit
These bits as a double1.78063581 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,047 to the power 212,989,154,778,209
3,604,047 to the power 346,813,524,310,939,811,823
3,604,047 to the power 4168,718,141,852,269,695,981,247,681
3,604,047 to the power 5608,068,112,988,247,040,992,127,760,965,007
First ten multiples3,604,047, 7,208,094, 10,812,141, 14,416,188, 18,020,235, 21,624,282, 25,228,329, 28,832,376, 32,436,423, 36,040,470
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached36,490,98410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,047 → 10,812,142 → 5,406,071 → 16,218,214 → 8,109,107 → 24,327,322 → 12,163,661 → 36,490,984 → 18,245,492 → 9,122,746 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,404,700%
3,604,047% as a decimal36,040.47
3,604,047% of 1003,604,047
3,604,047% of 1,00036,040,470
As a fraction of 1003,604,047/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,047
Nerdulate something else
Nothing in mind? Surprise me · today’s page