Recognised as Number
2,214,139
- Positive
- Odd
- Composite
- 7 digits
2,214,139 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,214,139
Digit count7
Digit sum22
Digit product432
Multiplicative persistence3times 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 factorisation269 × 8,231
Distinct prime factors2269, 8,231
Number of divisors4
Sum of divisors σ(n)2,222,640
Aliquot sum8,501sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,205,640integers below n that share no factor with it
Carmichael function λ(n)1,102,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,205,640
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 269, 8,231, 2,214,1394 in total
Arithmetic
Previous number2,214,138
Next number2,214,140
Double4,428,278
Half1,107,069.5
Square4,902,411,511,321
Cube10,854,620,521,264,767,619
Square root1,487.998319892≈irrational, shown to 9 decimal places
Cube root130.337172081≈
Negation-2,214,139
Reciprocal4.51642828 × 10^-7≈
Representations
Decimal2,214,139
Binary100001110010001111101122 bits
Octal10344373
Hexadecimal21C8FB
Base 361BGFV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fourteen thousand, one hundred and thirty-nine
Ordinaltwo million, two hundred and fourteen thousand, one hundred and thirty-ninth
Scientific notation2.214139 × 10^6
Engineering notation2.214139 × 10^6
In other bases
Ternary11011111020011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1031323024base 5; one hand: 10 digits
Septenary24551134base 7: 8 digits
Nonary4144204base 9; each digit is two ternary digits: 7 digits
Duodecimal8a93b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldgf6jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:15:2:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110111111T0011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101101100100001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011100100011111011
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 c8 fb
Gray code1100010010110010000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011100100011111011
64-bit0000000000000000000000000000000000000000001000011100100011111011
One's complement11111111110111100011011100000100at 32 bits, every bit flipped
Bits reversed11011111000100111000010000000000at 32 bits
Rotated left by 100000000010000111001000111110110at 32 bits, wrapping
Shifted left by 110000111001000111110110= 4,428,278, no wrap
Shifted right by 1100001110010001111101= 1,107,069, discarding the low bit
These bits as a double1.09393002 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,214,139 to the power 24,902,411,511,321
2,214,139 to the power 310,854,620,521,264,767,619
2,214,139 to the power 424,033,638,626,332,651,311,165,041
2,214,139 to the power 553,213,816,594,469,550,241,451,652,714,699
First ten multiples2,214,139, 4,428,278, 6,642,417, 8,856,556, 11,070,695, 13,284,834, 15,498,973, 17,713,112, 19,927,251, 22,141,390
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1192the total stopping time
Highest value reached42,559,50419× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,214,139 → 6,642,418 → 3,321,209 → 9,963,628 → 4,981,814 → 2,490,907 → 7,472,722 → 3,736,361 → 11,209,084 → 5,604,542 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage221,413,900%
2,214,139% as a decimal22,141.39
2,214,139% of 1002,214,139
2,214,139% of 1,00022,141,390
As a fraction of 1002,214,139/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,214,139
Nerdulate something else
Nothing in mind? Surprise me · today’s page