Recognised as Number
3,604,509
- Positive
- Odd
- Composite
- 7 digits
3,604,509 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,509
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 19 × 107 × 197
Distinct prime factors43, 19, 107, 197
Number of divisors24
Sum of divisors σ(n)5,559,840
Aliquot sum1,955,331sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,243,808integers below n that share no factor with it
Carmichael function λ(n)93,492the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,243,808
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 19, 57, 107, 171, 197, 321, 591, 963, 1,773, 2,033, 3,743, 6,099, 11,229, 18,297, 21,079, 33,687, 63,237, 189,711, 400,501, 1,201,503, 3,604,50924 in total
Arithmetic
Previous number3,604,508
Next number3,604,510
Double7,209,018
Half1,802,254.5
Square12,992,485,131,081
Cube46,831,529,587,347,644,229
Square root1,898.554450101≈irrational, shown to 9 decimal places
Cube root153.32584662≈
Negation-3,604,509
Reciprocal2.77430296 × 10^-7≈
Representations
Decimal3,604,509
Binary110111000000000001110122 bits
Octal15600035
Hexadecimal37001D
Base 3625999
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand, five hundred and nine
Ordinalthree million, six hundred and four thousand, five hundred and ninth
Scientific notation3.604509 × 10^6
Engineering notation3.604509 × 10^6
In other bases
Ternary20210010110100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410321014base 5; one hand: 10 digits
Septenary42431526base 7: 8 digits
Nonary6703410base 9; each digit is two ternary digits: 7 digits
Duodecimal1259b39base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ab59base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:15:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10010110100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000000001101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000000000011101
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; 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 1d
Gray code1011001000000000010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000000000011101
64-bit0000000000000000000000000000000000000000001101110000000000011101
One's complement11111111110010001111111111100010at 32 bits, every bit flipped
Bits reversed10111000000000001110110000000000at 32 bits
Rotated left by 100000000011011100000000000111010at 32 bits, wrapping
Shifted left by 111011100000000000111010= 7,209,018, no wrap
Shifted right by 1110111000000000001110= 1,802,254, discarding the low bit
These bits as a double1.78086407 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,509 to the power 212,992,485,131,081
3,604,509 to the power 346,831,529,587,347,644,229
3,604,509 to the power 4168,804,669,881,360,869,752,228,561
3,604,509 to the power 5608,457,951,829,394,187,269,735,618,181,549
First ten multiples3,604,509, 7,209,018, 10,813,527, 14,418,036, 18,022,545, 21,627,054, 25,231,563, 28,836,072, 32,440,581, 36,045,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1234the total stopping time
Highest value reached10,813,5283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,509 → 10,813,528 → 5,406,764 → 2,703,382 → 1,351,691 → 4,055,074 → 2,027,537 → 6,082,612 → 3,041,306 → 1,520,653 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,450,900%
3,604,509% as a decimal36,045.09
3,604,509% of 1003,604,509
3,604,509% of 1,00036,045,090
As a fraction of 1003,604,509/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,509
Nerdulate something else
Nothing in mind? Surprise me · today’s page