Recognised as Number
2,193,223
- Positive
- Odd
- Prime
- 7 digits
2,193,223 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,193,223
Digit count7
Digit sum22
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,193,223
Distinct prime factors12,193,223
Number of divisors2
Sum of divisors σ(n)2,193,224
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,193,222integers below n that share no factor with it
Carmichael function λ(n)2,193,222the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,193,2232 in total
Arithmetic
Previous number2,193,222
Next number2,193,224
Double4,386,446
Half1,096,611.5
Square4,810,227,127,729
Cube10,549,900,771,759,180,567
Square root1,480.953409125≈irrational, shown to 9 decimal places
Cube root129.925460227≈
Negation-2,193,223
Reciprocal4.55949988 × 10^-7≈
Representations
Decimal2,193,223
Binary100001011101110100011122 bits
Octal10273507
Hexadecimal217747
Base 361B0AV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and ninety-three thousand, two hundred and twenty-three
Ordinaltwo million, one hundred and ninety-three thousand, two hundred and twenty-third
Scientific notation2.193223 × 10^6
Engineering notation2.193223 × 10^6
In other bases
Ternary11010102112111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030140343base 5; one hand: 10 digits
Septenary24433144base 7: 8 digits
Nonary4112474base 9; each digit is two ternary digits: 7 digits
Duodecimal899287base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalde313base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:9:13:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11010110TTT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101000101101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010111011101000111
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
Bytes321 77 47
Gray code1100011100110011100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010111011101000111
64-bit0000000000000000000000000000000000000000001000010111011101000111
One's complement11111111110111101000100010111000at 32 bits, every bit flipped
Bits reversed11100010111011101000010000000000at 32 bits
Rotated left by 100000000010000101110111010001110at 32 bits, wrapping
Shifted left by 110000101110111010001110= 4,386,446, no wrap
Shifted right by 1100001011101110100011= 1,096,611, discarding the low bit
These bits as a double1.08359614 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,193,223 to the power 24,810,227,127,729
2,193,223 to the power 310,549,900,771,759,180,567
2,193,223 to the power 423,138,285,020,339,985,280,697,441
2,193,223 to the power 550,747,418,887,165,123,537,287,083,642,343
First ten multiples2,193,223, 4,386,446, 6,579,669, 8,772,892, 10,966,115, 13,159,338, 15,352,561, 17,545,784, 19,739,007, 21,932,230
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1148the total stopping time
Highest value reached18,736,6488× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,193,223 → 6,579,670 → 3,289,835 → 9,869,506 → 4,934,753 → 14,804,260 → 7,402,130 → 3,701,065 → 11,103,196 → 5,551,598 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage219,322,300%
2,193,223% as a decimal21,932.23
2,193,223% of 1002,193,223
2,193,223% of 1,00021,932,230
As a fraction of 1002,193,223/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,193,223
Nerdulate something else
Nothing in mind? Surprise me · today’s page