Recognised as Number
2,139,263
- Positive
- Odd
- Composite
- 7 digits
2,139,263 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,139,263
Digit count7
Digit sum26
Digit product1,944
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 17 × 17,977
Distinct prime factors37, 17, 17,977
Number of divisors8
Sum of divisors σ(n)2,588,832
Aliquot sum449,569sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,725,696integers below n that share no factor with it
Carmichael function λ(n)35,952the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,725,696
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 17, 119, 17,977, 125,839, 305,609, 2,139,2638 in total
Arithmetic
Previous number2,139,262
Next number2,139,264
Double4,278,526
Half1,069,631.5
Square4,576,446,183,169
Cube9,790,221,991,144,664,447
Square root1,462.621960727≈irrational, shown to 9 decimal places
Cube root128.851079074≈
Negation-2,139,263
Reciprocal4.67450706 × 10^-7≈
Representations
Decimal2,139,263
Binary100000101001000111111122 bits
Octal10122177
Hexadecimal20A47F
Base 3619UNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-nine thousand, two hundred and sixty-three
Ordinaltwo million, one hundred and thirty-nine thousand, two hundred and sixty-third
Scientific notation2.139263 × 10^6
Engineering notation2.139263 × 10^6
In other bases
Ternary11000200111222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021424023base 5; one hand: 10 digits
Septenary24116630base 7: 8 digits
Nonary4020458base 9; each digit is two ternary digits: 7 digits
Duodecimal871bbbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald7833base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:54:14:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11001T01TTT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011110010110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001010010001111111
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; 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
Bytes320 a4 7f
Gray code1100001111011001000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001010010001111111
64-bit0000000000000000000000000000000000000000001000001010010001111111
One's complement11111111110111110101101110000000at 32 bits, every bit flipped
Bits reversed11111110001001010000010000000000at 32 bits
Rotated left by 100000000010000010100100011111110at 32 bits, wrapping
Shifted left by 110000010100100011111110= 4,278,526, no wrap
Shifted right by 1100000101001000111111= 1,069,631, discarding the low bit
These bits as a double1.05693636 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,139,263 to the power 24,576,446,183,169
2,139,263 to the power 39,790,221,991,144,664,447
2,139,263 to the power 420,943,859,667,442,108,298,882,561
2,139,263 to the power 544,804,424,063,751,206,925,792,404,092,543
First ten multiples2,139,263, 4,278,526, 6,417,789, 8,557,052, 10,696,315, 12,835,578, 14,974,841, 17,114,104, 19,253,367, 21,392,630
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1210the total stopping time
Highest value reached117,096,35254× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,139,263 → 6,417,790 → 3,208,895 → 9,626,686 → 4,813,343 → 14,440,030 → 7,220,015 → 21,660,046 → 10,830,023 → 32,490,070 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage213,926,300%
2,139,263% as a decimal21,392.63
2,139,263% of 1002,139,263
2,139,263% of 1,00021,392,630
As a fraction of 1002,139,263/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,139,263
Nerdulate something else
Nothing in mind? Surprise me · today’s page