Recognised as Number
2,018,077
- Positive
- Odd
- Prime
- 7 digits
2,018,077 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,018,077
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,018,077
Distinct prime factors12,018,077
Number of divisors2
Sum of divisors σ(n)2,018,078
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,018,076integers below n that share no factor with it
Carmichael function λ(n)2,018,076the 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,018,0772 in total
Arithmetic
Previous number2,018,076
Next number2,018,078
Double4,036,154
Half1,009,038.5
Square4,072,634,777,929
Cube8,218,890,574,738,622,533
Square root1,420.590370233≈irrational, shown to 9 decimal places
Cube root126.37056026≈
Negation-2,018,077
Reciprocal4.95521231 × 10^-7≈
Representations
Decimal2,018,077
Binary11110110010110001110121 bits
Octal7545435
Hexadecimal1ECB1D
Base 361795P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eighteen thousand and seventy-seven
Ordinaltwo million, eighteen thousand and seventy-seventh
Scientific notation2.018077 × 10^6
Engineering notation2.018077 × 10^6
In other bases
Ternary10210112021121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1004034302base 5; one hand: 10 digits
Septenary23103415base 7: 8 digits
Nonary3715247base 9; each digit is two ternary digits: 7 digits
Duodecimal813a51base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcc53hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:20:34:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T11TTT10TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111101111101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101100101100011101
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31e cb 1d
Gray code100011010111010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101100101100011101
64-bit0000000000000000000000000000000000000000000111101100101100011101
One's complement11111111111000010011010011100010at 32 bits, every bit flipped
Bits reversed10111000110100110111100000000000at 32 bits
Rotated left by 100000000001111011001011000111010at 32 bits, wrapping
Shifted left by 11111011001011000111010= 4,036,154, no wrap
Shifted right by 111110110010110001110= 1,009,038, discarding the low bit
These bits as a double9.97062516 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,018,077 to the power 24,072,634,777,929
2,018,077 to the power 38,218,890,574,738,622,533
2,018,077 to the power 416,586,354,034,396,795,145,529,041
2,018,077 to the power 533,472,539,590,673,381,156,903,810,474,157
First ten multiples2,018,077, 4,036,154, 6,054,231, 8,072,308, 10,090,385, 12,108,462, 14,126,539, 16,144,616, 18,162,693, 20,180,770
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached6,054,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,018,077 → 6,054,232 → 3,027,116 → 1,513,558 → 756,779 → 2,270,338 → 1,135,169 → 3,405,508 → 1,702,754 → 851,377 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,807,700%
2,018,077% as a decimal20,180.77
2,018,077% of 1002,018,077
2,018,077% of 1,00020,180,770
As a fraction of 1002,018,077/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,018,077
Nerdulate something else
Nothing in mind? Surprise me · today’s page