Recognised as Number
3,511,081
- Positive
- Odd
- Composite
- 7 digits
3,511,081 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,511,081
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 73 × 6,871
Distinct prime factors37, 73, 6,871
Number of divisors8
Sum of divisors σ(n)4,068,224
Aliquot sum557,143sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,967,840integers below n that share no factor with it
Carmichael function λ(n)82,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,967,840
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 73, 511, 6,871, 48,097, 501,583, 3,511,0818 in total
Arithmetic
Previous number3,511,080
Next number3,511,082
Double7,022,162
Half1,755,540.5
Square12,327,689,788,561
Cube43,283,517,390,510,544,441
Square root1,873.787874867≈irrational, shown to 9 decimal places
Cube root151.989510472≈
Negation-3,511,081
Reciprocal2.84812569 × 10^-7≈
Representations
Decimal3,511,081
Binary110101100100110010100122 bits
Octal15311451
Hexadecimal359329
Base 3623961
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and eleven thousand and eighty-one
Ordinalthree million, five hundred and eleven thousand and eighty-first
Scientific notation3.511081 × 10^6
Engineering notation3.511081 × 10^6
In other bases
Ternary20121101022001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344323311base 5; one hand: 10 digits
Septenary41562250base 7: 8 digits
Nonary6541261base 9; each digit is two ternary digits: 7 digits
Duodecimal1213a61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11ihe1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:18:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT110110T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101001011101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011001001100101001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 93 29
Gray code1011110101101010111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011001001100101001
64-bit0000000000000000000000000000000000000000001101011001001100101001
One's complement11111111110010100110110011010110at 32 bits, every bit flipped
Bits reversed10010100110010011010110000000000at 32 bits
Rotated left by 100000000011010110010011001010010at 32 bits, wrapping
Shifted left by 111010110010011001010010= 7,022,162, no wrap
Shifted right by 1110101100100110010100= 1,755,540, discarding the low bit
These bits as a double1.7347045 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,511,081 to the power 212,327,689,788,561
3,511,081 to the power 343,283,517,390,510,544,441
3,511,081 to the power 4151,971,935,522,991,152,886,450,721
3,511,081 to the power 5533,585,775,347,999,300,067,712,283,939,401
First ten multiples3,511,081, 7,022,162, 10,533,243, 14,044,324, 17,555,405, 21,066,486, 24,577,567, 28,088,648, 31,599,729, 35,110,810
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1151the total stopping time
Highest value reached39,993,42411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,511,081 → 10,533,244 → 5,266,622 → 2,633,311 → 7,899,934 → 3,949,967 → 11,849,902 → 5,924,951 → 17,774,854 → 8,887,427 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage351,108,100%
3,511,081% as a decimal35,110.81
3,511,081% of 1003,511,081
3,511,081% of 1,00035,110,810
As a fraction of 1003,511,081/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,081
Nerdulate something else
Nothing in mind? Surprise me · today’s page