Recognised as Number
3,609,520
- Positive
- Even
- Composite
- 7 digits
3,609,520 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,609,520
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 × 5 × 45,119
Distinct prime factors32, 5, 45,119
Number of divisors20
Sum of divisors σ(n)8,392,320
Aliquot sum4,782,800sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,443,776integers below n that share no factor with it
Carmichael function λ(n)90,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,443,776
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 45,119, 90,238, 180,476, 225,595, 360,952, 451,190, 721,904, 902,380, 1,804,760, 3,609,52020 in total
Arithmetic
Previous number3,609,519
Next number3,609,521
Double7,219,040
Half1,804,760
Square13,028,634,630,400
Cube47,027,117,271,121,408,000
Square root1,899.873680011≈irrational, shown to 9 decimal places
Cube root153.396865082≈
Negation-3,609,520
Reciprocal2.77045147 × 10^-7≈
Representations
Decimal3,609,520
Binary110111000100111011000022 bits
Octal15611660
Hexadecimal3713B0
Base 3625D4G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and nine thousand, five hundred and twenty
Ordinalthree million, six hundred and nine thousand, five hundred and twentieth
Scientific notation3.60952 × 10^6
Engineering notation3.60952 × 10^6
In other bases
Ternary20210101022221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411001040base 5; one hand: 10 digits
Septenary42452245base 7: 8 digits
Nonary6711287base 9; each digit is two ternary digits: 7 digits
Duodecimal1260a14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12b3g0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:42:38:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101011000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110001010011110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110001001110110000
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes337 13 b0
Gray code1011001001101001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110001001110110000
64-bit0000000000000000000000000000000000000000001101110001001110110000
One's complement11111111110010001110110001001111at 32 bits, every bit flipped
Bits reversed00001101110010001110110000000000at 32 bits
Rotated left by 100000000011011100010011101100000at 32 bits, wrapping
Shifted left by 111011100010011101100000= 7,219,040, no wrap
Shifted right by 1110111000100111011000= 1,804,760, discarding the low bit
These bits as a double1.78333983 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,609,520 to the power 213,028,634,630,400
3,609,520 to the power 347,027,117,271,121,408,000
3,609,520 to the power 4169,745,320,332,458,144,604,160,000
3,609,520 to the power 5612,699,128,646,414,322,111,607,603,200,000
First ten multiples3,609,520, 7,219,040, 10,828,560, 14,438,080, 18,047,600, 21,657,120, 25,266,640, 28,876,160, 32,485,680, 36,095,200
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached3,609,520
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,609,520 → 1,804,760 → 902,380 → 451,190 → 225,595 → 676,786 → 338,393 → 1,015,180 → 507,590 → 253,795 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,952,000%
3,609,520% as a decimal36,095.2
3,609,520% of 1003,609,520
3,609,520% of 1,00036,095,200
As a fraction of 1003,609,520/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,609,520
Nerdulate something else
Nothing in mind? Surprise me · today’s page