Recognised as Number
2,264,006
- Positive
- Even
- Composite
- 7 digits
2,264,006 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,264,006
Digit count7
Digit sum20
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 × 1,132,003
Distinct prime factors22, 1,132,003
Number of divisors4
Sum of divisors σ(n)3,396,012
Aliquot sum1,132,006sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,132,002integers below n that share no factor with it
Carmichael function λ(n)1,132,002the 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,132,003, 2,264,0064 in total
Arithmetic
Previous number2,264,005
Next number2,264,007
Double4,528,012
Half1,132,003
Square5,125,723,168,036
Cube11,604,668,006,772,512,216
Square root1,504.66142371≈irrational, shown to 9 decimal places
Cube root131.308404544≈
Negation-2,264,006
Reciprocal4.41694943 × 10^-7≈
Representations
Decimal2,264,006
Binary100010100010111100011022 bits
Octal10505706
Hexadecimal228BC6
Base 361CIX2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and sixty-four thousand and six
Ordinaltwo million, two hundred and sixty-four thousand and sixth
Scientific notation2.264006 × 10^6
Engineering notation2.264006 × 10^6
In other bases
Ternary11021000122002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1034422011base 5; one hand: 10 digits
Septenary25146413base 7: 8 digits
Nonary4230562base 9; each digit is two ternary digits: 7 digits
Duodecimal912232base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale3006base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:28:53:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T1001T0T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001111001110011011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000101000101111000110
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes322 8b c6
Gray code1100111100111000100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000101000101111000110
64-bit0000000000000000000000000000000000000000001000101000101111000110
One's complement11111111110111010111010000111001at 32 bits, every bit flipped
Bits reversed01100011110100010100010000000000at 32 bits
Rotated left by 100000000010001010001011110001100at 32 bits, wrapping
Shifted left by 110001010001011110001100= 4,528,012, no wrap
Shifted right by 1100010100010111100011= 1,132,003, discarding the low bit
These bits as a double1.11856759 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,264,006 to the power 25,125,723,168,036
2,264,006 to the power 311,604,668,006,772,512,216
2,264,006 to the power 426,273,037,995,341,008,292,097,296
2,264,006 to the power 559,482,315,659,680,014,819,358,030,727,776
First ten multiples2,264,006, 4,528,012, 6,792,018, 9,056,024, 11,320,030, 13,584,036, 15,848,042, 18,112,048, 20,376,054, 22,640,060
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 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 6
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Highest value reached5,094,0162× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,264,006 → 1,132,003 → 3,396,010 → 1,698,005 → 5,094,016 → 2,547,008 → 1,273,504 → 636,752 → 318,376 → 159,188 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage226,400,600%
2,264,006% as a decimal22,640.06
2,264,006% of 1002,264,006
2,264,006% of 1,00022,640,060
As a fraction of 1002,264,006/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,264,006
Nerdulate something else
Nothing in mind? Surprise me · today’s page