Recognised as Number
2,138,657
- Positive
- Odd
- Prime
- 7 digits
2,138,657 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,138,657
Digit count7
Digit sum32
Digit product10,080
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,138,657
Distinct prime factors12,138,657
Number of divisors2
Sum of divisors σ(n)2,138,658
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,138,656integers below n that share no factor with it
Carmichael function λ(n)2,138,656the 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,138,6572 in total
Arithmetic
Previous number2,138,656
Next number2,138,658
Double4,277,314
Half1,069,328.5
Square4,573,853,763,649
Cube9,781,904,368,604,279,393
Square root1,462.414783842≈irrational, shown to 9 decimal places
Cube root128.838911157≈
Negation-2,138,657
Reciprocal4.67583161 × 10^-7≈
Representations
Decimal2,138,657
Binary100000101000100010000122 bits
Octal10121041
Hexadecimal20A221
Base 3619U75
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-eight thousand, six hundred and fifty-seven
Ordinaltwo million, one hundred and thirty-eight thousand, six hundred and fifty-seventh
Scientific notation2.138657 × 10^6
Engineering notation2.138657 × 10^6
In other bases
Ternary11000122200112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021414112base 5; one hand: 10 digits
Septenary24115103base 7: 8 digits
Nonary4018615base 9; each digit is two ternary digits: 7 digits
Duodecimal871795base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald76chbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:54:4:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11001T00T01TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011110011001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000001010001000100001
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 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
Bytes320 a2 21
Gray code1100001111001100110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000001010001000100001
64-bit0000000000000000000000000000000000000000001000001010001000100001
One's complement11111111110111110101110111011110at 32 bits, every bit flipped
Bits reversed10000100010001010000010000000000at 32 bits
Rotated left by 100000000010000010100010001000010at 32 bits, wrapping
Shifted left by 110000010100010001000010= 4,277,314, no wrap
Shifted right by 1100000101000100010000= 1,069,328, discarding the low bit
These bits as a double1.05663695 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,138,657 to the power 24,573,853,763,649
2,138,657 to the power 39,781,904,368,604,279,393
2,138,657 to the power 420,920,138,251,246,122,353,795,201
2,138,657 to the power 544,741,000,111,995,278,294,800,583,185,057
First ten multiples2,138,657, 4,277,314, 6,415,971, 8,554,628, 10,693,285, 12,831,942, 14,970,599, 17,109,256, 19,247,913, 21,386,570
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1184the total stopping time
Highest value reached6,415,9723× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,138,657 → 6,415,972 → 3,207,986 → 1,603,993 → 4,811,980 → 2,405,990 → 1,202,995 → 3,608,986 → 1,804,493 → 5,413,480 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage213,865,700%
2,138,657% as a decimal21,386.57
2,138,657% of 1002,138,657
2,138,657% of 1,00021,386,570
As a fraction of 1002,138,657/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,138,657
Nerdulate something else
Nothing in mind? Surprise me · today’s page