Recognised as Number
2,690,841
- Positive
- Odd
- Composite
- 7 digits
2,690,841 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,690,841
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 896,947
Distinct prime factors23, 896,947
Number of divisors4
Sum of divisors σ(n)3,587,792
Aliquot sum896,951sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,793,892integers below n that share no factor with it
Carmichael function λ(n)896,946the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,793,892
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 896,947, 2,690,8414 in total
Arithmetic
Previous number2,690,840
Next number2,690,842
Double5,381,682
Half1,345,420.5
Square7,240,625,287,281
Cube19,483,371,388,652,493,321
Square root1,640.378310025≈irrational, shown to 9 decimal places
Cube root139.090033626≈
Negation-2,690,841
Reciprocal3.71631025 × 10^-7≈
Representations
Decimal2,690,841
Binary101001000011110001100122 bits
Octal12207431
Hexadecimal290F19
Base 361LO9L
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and ninety thousand, eight hundred and forty-one
Ordinaltwo million, six hundred and ninety thousand, eight hundred and forty-first
Scientific notation2.690841 × 10^6
Engineering notation2.690841 × 10^6
In other bases
Ternary12001201010210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1142101331base 5; one hand: 10 digits
Septenary31605006base 7: 8 digits
Nonary5051123base 9; each digit is two ternary digits: 7 digits
Duodecimala99249base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgg721base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:27:27:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01TT01011T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010001001101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010000111100011001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes329 0f 19
Gray code1111011000100010010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010000111100011001
64-bit0000000000000000000000000000000000000000001010010000111100011001
One's complement11111111110101101111000011100110at 32 bits, every bit flipped
Bits reversed10011000111100001001010000000000at 32 bits
Rotated left by 100000000010100100001111000110010at 32 bits, wrapping
Shifted left by 110100100001111000110010= 5,381,682, no wrap
Shifted right by 1101001000011110001100= 1,345,420, discarding the low bit
These bits as a double1.3294521 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,690,841 to the power 27,240,625,287,281
2,690,841 to the power 319,483,371,388,652,493,321
2,690,841 to the power 452,426,654,550,813,063,780,372,961
2,690,841 to the power 5141,071,791,558,164,375,355,842,558,750,201
First ten multiples2,690,841, 5,381,682, 8,072,523, 10,763,364, 13,454,205, 16,145,046, 18,835,887, 21,526,728, 24,217,569, 26,908,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 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached17,240,8486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,690,841 → 8,072,524 → 4,036,262 → 2,018,131 → 6,054,394 → 3,027,197 → 9,081,592 → 4,540,796 → 2,270,398 → 1,135,199 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage269,084,100%
2,690,841% as a decimal26,908.41
2,690,841% of 1002,690,841
2,690,841% of 1,00026,908,410
As a fraction of 1002,690,841/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 2,690,841
Nerdulate something else
Nothing in mind? Surprise me · today’s page