Recognised as Number
3,558,620
- Positive
- Even
- Composite
- 7 digits
3,558,620 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,558,620
Digit count7
Digit sum29
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 5 × 13 × 13,687
Distinct prime factors42, 5, 13, 13,687
Number of divisors24
Sum of divisors σ(n)8,048,544
Aliquot sum4,489,924sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,313,856integers below n that share no factor with it
Carmichael function λ(n)27,372the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,313,856
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 260, 13,687, 27,374, 54,748, 68,435, 136,870, 177,931, 273,740, 355,862, 711,724, 889,655, 1,779,310, 3,558,62024 in total
Arithmetic
Previous number3,558,619
Next number3,558,621
Double7,117,240
Half1,779,310
Square12,663,776,304,400
Cube45,065,567,632,363,928,000
Square root1,886.430491696≈irrational, shown to 9 decimal places
Cube root152.672401997≈
Negation-3,558,620
Reciprocal2.81007806 × 10^-7≈
Representations
Decimal3,558,620
Binary110110010011001101110022 bits
Octal15446334
Hexadecimal364CDC
Base 36249UK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-eight thousand, six hundred and twenty
Ordinalthree million, five hundred and fifty-eight thousand, six hundred and twentieth
Scientific notation3.55862 × 10^6
Engineering notation3.55862 × 10^6
In other bases
Ternary20200210111202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402333440base 5; one hand: 10 digits
Septenary42150662base 7: 8 digits
Nonary6623452base 9; each digit is two ternary digits: 7 digits
Duodecimal1237478base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal124gb0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:28:30:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01T11TTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100101110100101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100100110011011100
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 4c dc
Gray code1011010110101010110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100100110011011100
64-bit0000000000000000000000000000000000000000001101100100110011011100
One's complement11111111110010011011001100100011at 32 bits, every bit flipped
Bits reversed00111011001100100110110000000000at 32 bits
Rotated left by 100000000011011001001100110111000at 32 bits, wrapping
Shifted left by 111011001001100110111000= 7,117,240, no wrap
Shifted right by 1110110010011001101110= 1,779,310, discarding the low bit
These bits as a double1.75819189 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,558,620 to the power 212,663,776,304,400
3,558,620 to the power 345,065,567,632,363,928,000
3,558,620 to the power 4160,371,230,287,882,921,459,360,000
3,558,620 to the power 5570,700,267,527,065,921,963,707,683,200,000
First ten multiples3,558,620, 7,117,240, 10,675,860, 14,234,480, 17,793,100, 21,351,720, 24,910,340, 28,468,960, 32,027,580, 35,586,200
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 20
Collatz (3n + 1) trajectory
Steps to reach 1265the total stopping time
Highest value reached6,589,0241× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,558,620 → 1,779,310 → 889,655 → 2,668,966 → 1,334,483 → 4,003,450 → 2,001,725 → 6,005,176 → 3,002,588 → 1,501,294 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,862,000%
3,558,620% as a decimal35,586.2
3,558,620% of 1003,558,620
3,558,620% of 1,00035,586,200
As a fraction of 1003,558,620/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,558,620
Nerdulate something else
Nothing in mind? Surprise me · today’s page