Recognised as Number
3,511,641
- Positive
- Odd
- Composite
- 7 digits
3,511,641 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,511,641
Digit count7
Digit sum21
Digit product360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 167,221
Distinct prime factors33, 7, 167,221
Number of divisors8
Sum of divisors σ(n)5,351,104
Aliquot sum1,839,463sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,006,640integers below n that share no factor with it
Carmichael function λ(n)167,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,006,640
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 167,221, 501,663, 1,170,547, 3,511,6418 in total
Arithmetic
Previous number3,511,640
Next number3,511,642
Double7,023,282
Half1,755,820.5
Square12,331,622,512,881
Cube43,304,231,212,755,947,721
Square root1,873.937298844≈irrational, shown to 9 decimal places
Cube root151.997590567≈
Negation-3,511,641
Reciprocal2.8476715 × 10^-7≈
Representations
Decimal3,511,641
Binary110101100101010101100122 bits
Octal15312531
Hexadecimal359559
Base 36239LL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and eleven thousand, six hundred and forty-one
Ordinalthree million, five hundred and eleven thousand, six hundred and forty-first
Scientific notation3.511641 × 10^6
Engineering notation3.511641 × 10^6
In other bases
Ternary20121102001210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344333031base 5; one hand: 10 digits
Septenary41564010base 7: 8 digits
Nonary6542053base 9; each digit is two ternary digits: 7 digits
Duodecimal1214249base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11ij21base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:27:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT111T01TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101110101010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011001010101011001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 95 59
Gray code1011110101111111110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011001010101011001
64-bit0000000000000000000000000000000000000000001101011001010101011001
One's complement11111111110010100110101010100110at 32 bits, every bit flipped
Bits reversed10011010101010011010110000000000at 32 bits
Rotated left by 100000000011010110010101010110010at 32 bits, wrapping
Shifted left by 111010110010101010110010= 7,023,282, no wrap
Shifted right by 1110101100101010101100= 1,755,820, discarding the low bit
These bits as a double1.73498118 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,511,641 to the power 212,331,622,512,881
3,511,641 to the power 343,304,231,212,755,947,721
3,511,641 to the power 4152,068,913,800,193,509,010,920,161
3,511,641 to the power 5534,011,432,526,225,334,176,616,685,094,201
First ten multiples3,511,641, 7,023,282, 10,534,923, 14,046,564, 17,558,205, 21,069,846, 24,581,487, 28,093,128, 31,604,769, 35,116,410
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 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1151the total stopping time
Highest value reached11,851,7923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,511,641 → 10,534,924 → 5,267,462 → 2,633,731 → 7,901,194 → 3,950,597 → 11,851,792 → 5,925,896 → 2,962,948 → 1,481,474 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage351,164,100%
3,511,641% as a decimal35,116.41
3,511,641% of 1003,511,641
3,511,641% of 1,00035,116,410
As a fraction of 1003,511,641/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,641
Nerdulate something else
Nothing in mind? Surprise me · today’s page