Recognised as Number
2,188,132
- Positive
- Even
- Composite
- 7 digits
2,188,132 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,188,132
Digit count7
Digit sum25
Digit product768
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 47 × 103 × 113
Distinct prime factors42, 47, 103, 113
Number of divisors24
Sum of divisors σ(n)3,983,616
Aliquot sum1,795,484sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,051,008integers below n that share no factor with it
Carmichael function λ(n)131,376the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,051,008
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 47, 94, 103, 113, 188, 206, 226, 412, 452, 4,841, 5,311, 9,682, 10,622, 11,639, 19,364, 21,244, 23,278, 46,556, 547,033, 1,094,066, 2,188,13224 in total
Arithmetic
Previous number2,188,131
Next number2,188,133
Double4,376,264
Half1,094,066
Square4,787,921,649,424
Cube10,476,604,574,597,435,968
Square root1,479.233585341≈irrational, shown to 9 decimal places
Cube root129.82485289≈
Negation-2,188,132
Reciprocal4.5701082 × 10^-7≈
Representations
Decimal2,188,132
Binary100001011000110110010022 bits
Octal10261544
Hexadecimal216364
Base 361AWDG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and eighty-eight thousand, one hundred and thirty-two
Ordinaltwo million, one hundred and eighty-eight thousand, one hundred and thirty-second
Scientific notation2.188132 × 10^6
Engineering notation2.188132 × 10^6
In other bases
Ternary11010011112221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030010012base 5; one hand: 10 digits
Septenary24412252base 7: 8 digits
Nonary4104487base 9; each digit is two ternary digits: 7 digits
Duodecimal896344base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldda6cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:7:48:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110101TTTT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101010010010100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010110001101100100
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes321 63 64
Gray code1100011101001011010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010110001101100100
64-bit0000000000000000000000000000000000000000001000010110001101100100
One's complement11111111110111101001110010011011at 32 bits, every bit flipped
Bits reversed00100110110001101000010000000000at 32 bits
Rotated left by 100000000010000101100011011001000at 32 bits, wrapping
Shifted left by 110000101100011011001000= 4,376,264, no wrap
Shifted right by 1100001011000110110010= 1,094,066, discarding the low bit
These bits as a double1.08108085 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,188,132 to the power 24,787,921,649,424
2,188,132 to the power 310,476,604,574,597,435,968
2,188,132 to the power 422,924,193,721,023,036,759,531,776
2,188,132 to the power 550,161,161,855,169,579,470,707,784,082,432
First ten multiples2,188,132, 4,376,264, 6,564,396, 8,752,528, 10,940,660, 13,128,792, 15,316,924, 17,505,056, 19,693,188, 21,881,320
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 1179the total stopping time
Highest value reached2,188,132
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,188,132 → 1,094,066 → 547,033 → 1,641,100 → 820,550 → 410,275 → 1,230,826 → 615,413 → 1,846,240 → 923,120 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage218,813,200%
2,188,132% as a decimal21,881.32
2,188,132% of 1002,188,132
2,188,132% of 1,00021,881,320
As a fraction of 1002,188,132/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,188,132
Nerdulate something else
Nothing in mind? Surprise me · today’s page