Recognised as Number
2,015,287
- Positive
- Odd
- Prime
- 7 digits
2,015,287 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,015,287
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,015,287
Distinct prime factors12,015,287
Number of divisors2
Sum of divisors σ(n)2,015,288
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,015,286integers below n that share no factor with it
Carmichael function λ(n)2,015,286the 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,015,2872 in total
Arithmetic
Previous number2,015,286
Next number2,015,288
Double4,030,574
Half1,007,643.5
Square4,061,381,692,369
Cube8,184,849,726,669,244,903
Square root1,419.608044497≈irrational, shown to 9 decimal places
Cube root126.312297458≈
Negation-2,015,287
Reciprocal4.9620724 × 10^-7≈
Representations
Decimal2,015,287
Binary11110110000000011011121 bits
Octal7540067
Hexadecimal1EC037
Base 3617707
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, fifteen thousand, two hundred and eighty-seven
Ordinaltwo million, fifteen thousand, two hundred and eighty-seventh
Scientific notation2.015287 × 10^6
Engineering notation2.015287 × 10^6
In other bases
Ternary10210101110021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003442122base 5; one hand: 10 digits
Septenary23062321base 7: 8 digits
Nonary3711407base 9; each digit is two ternary digits: 7 digits
Duodecimal812307base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbi47base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:48:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T101011101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100000001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101100000000110111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 c0 37
Gray code100011010000000101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101100000000110111
64-bit0000000000000000000000000000000000000000000111101100000000110111
One's complement11111111111000010011111111001000at 32 bits, every bit flipped
Bits reversed11101100000000110111100000000000at 32 bits
Rotated left by 100000000001111011000000001101110at 32 bits, wrapping
Shifted left by 11111011000000001101110= 4,030,574, no wrap
Shifted right by 111110110000000011011= 1,007,643, discarding the low bit
These bits as a double9.95684073 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,015,287 to the power 24,061,381,692,369
2,015,287 to the power 38,184,849,726,669,244,903
2,015,287 to the power 416,494,821,251,110,082,552,832,161
2,015,287 to the power 533,241,798,834,685,884,937,649,467,245,207
First ten multiples2,015,287, 4,030,574, 6,045,861, 8,061,148, 10,076,435, 12,091,722, 14,107,009, 16,122,296, 18,137,583, 20,152,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1135the total stopping time
Highest value reached21,789,70010× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,015,287 → 6,045,862 → 3,022,931 → 9,068,794 → 4,534,397 → 13,603,192 → 6,801,596 → 3,400,798 → 1,700,399 → 5,101,198 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,528,700%
2,015,287% as a decimal20,152.87
2,015,287% of 1002,015,287
2,015,287% of 1,00020,152,870
As a fraction of 1002,015,287/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,015,287
Nerdulate something else
Nothing in mind? Surprise me · today’s page