Recognised as Number
2,690,336
- Positive
- Even
- Composite
- 7 digits
2,690,336 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 value2,690,336
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^5 × 11 × 7,643
Distinct prime factors32, 11, 7,643
Number of divisors24
Sum of divisors σ(n)5,778,864
Aliquot sum3,088,528sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,222,720integers below n that share no factor with it
Carmichael function λ(n)152,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,222,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 16, 22, 32, 44, 88, 176, 352, 7,643, 15,286, 30,572, 61,144, 84,073, 122,288, 168,146, 244,576, 336,292, 672,584, 1,345,168, 2,690,33624 in total
Arithmetic
Previous number2,690,335
Next number2,690,337
Double5,380,672
Half1,345,168
Square7,237,907,792,896
Cube19,472,403,899,908,653,056
Square root1,640.224374895≈irrational, shown to 9 decimal places
Cube root139.081331902≈
Negation-2,690,336
Reciprocal3.71700784 × 10^-7≈
Representations
Decimal2,690,336
Binary101001000011010010000022 bits
Octal12206440
Hexadecimal290D20
Base 361LNVK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and ninety thousand, three hundred and thirty-six
Ordinaltwo million, six hundred and ninety thousand, three hundred and thirty-sixth
Scientific notation2.690336 × 10^6
Engineering notation2.690336 × 10^6
In other bases
Ternary12001200110002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1142042321base 5; one hand: 10 digits
Septenary31603355base 7: 8 digits
Nonary5050402base 9; each digit is two ternary digits: 7 digits
Duodecimala98aa8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgg5ggbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:27:18:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01TT0011001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010001110101100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010000110100100000
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes329 0d 20
Gray code1111011000101110110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010000110100100000
64-bit0000000000000000000000000000000000000000001010010000110100100000
One's complement11111111110101101111001011011111at 32 bits, every bit flipped
Bits reversed00000100101100001001010000000000at 32 bits
Rotated left by 100000000010100100001101001000000at 32 bits, wrapping
Shifted left by 110100100001101001000000= 5,380,672, no wrap
Shifted right by 1101001000011010010000= 1,345,168, discarding the low bit
These bits as a double1.32920259 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,690,336 to the power 27,237,907,792,896
2,690,336 to the power 319,472,403,899,908,653,056
2,690,336 to the power 452,387,309,218,464,646,028,066,816
2,690,336 to the power 5140,939,463,933,567,301,936,565,165,490,176
First ten multiples2,690,336, 5,380,672, 8,071,008, 10,761,344, 13,451,680, 16,142,016, 18,832,352, 21,522,688, 24,213,024, 26,903,360
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 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 36
Collatz (3n + 1) trajectory
Steps to reach 1231the total stopping time
Highest value reached2,690,336
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,690,336 → 1,345,168 → 672,584 → 336,292 → 168,146 → 84,073 → 252,220 → 126,110 → 63,055 → 189,166 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage269,033,600%
2,690,336% as a decimal26,903.36
2,690,336% of 1002,690,336
2,690,336% of 1,00026,903,360
As a fraction of 1002,690,336/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,336
Nerdulate something else
Nothing in mind? Surprise me · today’s page