Recognised as Number
2,321,607
- Positive
- Odd
- Composite
- 7 digits
2,321,607 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,321,607
Digit count7
Digit sum21
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 773,869
Distinct prime factors23, 773,869
Number of divisors4
Sum of divisors σ(n)3,095,480
Aliquot sum773,873sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,547,736integers below n that share no factor with it
Carmichael function λ(n)773,868the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,547,736
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 773,869, 2,321,6074 in total
Arithmetic
Previous number2,321,606
Next number2,321,608
Double4,643,214
Half1,160,803.5
Square5,389,859,062,449
Cube12,513,134,528,395,035,543
Square root1,523.682053448≈irrational, shown to 9 decimal places
Cube root132.41267772≈
Negation-2,321,607
Reciprocal4.30736124 × 10^-7≈
Representations
Decimal2,321,607
Binary100011011011001100011122 bits
Octal10666307
Hexadecimal236CC7
Base 361DRD3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and twenty-one thousand, six hundred and seven
Ordinaltwo million, three hundred and twenty-one thousand, six hundred and seventh
Scientific notation2.321607 × 10^6
Engineering notation2.321607 × 10^6
In other bases
Ternary11100221122110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1043242412base 5; one hand: 10 digits
Septenary25506351base 7: 8 digits
Nonary4327573base 9; each digit is two ternary digits: 7 digits
Duodecimal93b633base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalea407base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:44:53:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1110100TT0T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001011110111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000110110110011000111
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
Bytes323 6c c7
Gray code1100101101101010100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000110110110011000111
64-bit0000000000000000000000000000000000000000001000110110110011000111
One's complement11111111110111001001001100111000at 32 bits, every bit flipped
Bits reversed11100011001101101100010000000000at 32 bits
Rotated left by 100000000010001101101100110001110at 32 bits, wrapping
Shifted left by 110001101101100110001110= 4,643,214, no wrap
Shifted right by 1100011011011001100011= 1,160,803, discarding the low bit
These bits as a double1.14702626 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,321,607 to the power 25,389,859,062,449
2,321,607 to the power 312,513,134,528,395,035,543
2,321,607 to the power 429,050,580,713,063,613,281,877,601
2,321,607 to the power 567,444,031,537,513,476,040,500,011,624,807
First ten multiples2,321,607, 4,643,214, 6,964,821, 9,286,428, 11,608,035, 13,929,642, 16,251,249, 18,572,856, 20,894,463, 23,216,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
Collatz (3n + 1) trajectory
Steps to reach 1192the total stopping time
Highest value reached15,670,8526× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,321,607 → 6,964,822 → 3,482,411 → 10,447,234 → 5,223,617 → 15,670,852 → 7,835,426 → 3,917,713 → 11,753,140 → 5,876,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage232,160,700%
2,321,607% as a decimal23,216.07
2,321,607% of 1002,321,607
2,321,607% of 1,00023,216,070
As a fraction of 1002,321,607/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,321,607
Nerdulate something else
Nothing in mind? Surprise me · today’s page