Recognised as Number
3,511,642
- Positive
- Even
- Composite
- 7 digits
3,511,642 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,511,642
Digit count7
Digit sum22
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 1,755,821
Distinct prime factors22, 1,755,821
Number of divisors4
Sum of divisors σ(n)5,267,466
Aliquot sum1,755,824sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,755,820integers below n that share no factor with it
Carmichael function λ(n)1,755,820the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,755,821, 3,511,6424 in total
Arithmetic
Previous number3,511,641
Next number3,511,643
Double7,023,284
Half1,755,821
Square12,331,629,536,164
Cube43,304,268,207,634,021,288
Square root1,873.937565662≈irrational, shown to 9 decimal places
Cube root151.997604995≈
Negation-3,511,642
Reciprocal2.84767069 × 10^-7≈
Representations
Decimal3,511,642
Binary110101100101010101101022 bits
Octal15312532
Hexadecimal35955A
Base 36239LM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and eleven thousand, six hundred and forty-two
Ordinalthree million, five hundred and eleven thousand, six hundred and forty-second
Scientific notation3.511642 × 10^6
Engineering notation3.511642 × 10^6
In other bases
Ternary20121102001211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344333032base 5; one hand: 10 digits
Septenary41564011base 7: 8 digits
Nonary6542054base 9; each digit is two ternary digits: 7 digits
Duodecimal121424abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11ij22base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:27:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT111T01TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101110101010101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011001010101011010
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 11 trailing zero
Power of twoNo
Bytes335 95 5a
Gray code1011110101111111110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011001010101011010
64-bit0000000000000000000000000000000000000000001101011001010101011010
One's complement11111111110010100110101010100101at 32 bits, every bit flipped
Bits reversed01011010101010011010110000000000at 32 bits
Rotated left by 100000000011010110010101010110100at 32 bits, wrapping
Shifted left by 111010110010101010110100= 7,023,284, no wrap
Shifted right by 1110101100101010101101= 1,755,821, discarding the low bit
These bits as a double1.73498167 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,511,642 to the power 212,331,629,536,164
3,511,642 to the power 343,304,268,207,634,021,288
3,511,642 to the power 4152,069,087,017,192,349,783,834,896
3,511,642 to the power 5534,012,192,871,227,377,579,605,541,859,232
First ten multiples3,511,642, 7,023,284, 10,534,926, 14,046,568, 17,558,210, 21,069,852, 24,581,494, 28,093,136, 31,604,778, 35,116,420
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 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 42
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached5,267,4641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,511,642 → 1,755,821 → 5,267,464 → 2,633,732 → 1,316,866 → 658,433 → 1,975,300 → 987,650 → 493,825 → 1,481,476 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage351,164,200%
3,511,642% as a decimal35,116.42
3,511,642% of 1003,511,642
3,511,642% of 1,00035,116,420
As a fraction of 1003,511,642/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,511,642
Nerdulate something else
Nothing in mind? Surprise me · today’s page