Recognised as Number
2,015,317
- Positive
- Odd
- Prime
- 7 digits
2,015,317 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,015,317
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,015,317
Distinct prime factors12,015,317
Number of divisors2
Sum of divisors σ(n)2,015,318
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,015,316integers below n that share no factor with it
Carmichael function λ(n)2,015,316the 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,3172 in total
Arithmetic
Previous number2,015,316
Next number2,015,318
Double4,030,634
Half1,007,658.5
Square4,061,502,610,489
Cube8,185,215,256,462,860,013
Square root1,419.618610754≈irrational, shown to 9 decimal places
Cube root126.312924225≈
Negation-2,015,317
Reciprocal4.96199853 × 10^-7≈
Representations
Decimal2,015,317
Binary11110110000000101010121 bits
Octal7540125
Hexadecimal1EC055
Base 3617711
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, fifteen thousand, three hundred and seventeen
Ordinaltwo million, fifteen thousand, three hundred and seventeenth
Scientific notation2.015317 × 10^6
Engineering notation2.015317 × 10^6
In other bases
Ternary10210101111101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003442232base 5; one hand: 10 digits
Septenary23062363base 7: 8 digits
Nonary3711441base 9; each digit is two ternary digits: 7 digits
Duodecimal812331base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbi5hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:48:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10101111101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100000001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101100000001010101
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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 55
Gray code100011010000001111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101100000001010101
64-bit0000000000000000000000000000000000000000000111101100000001010101
One's complement11111111111000010011111110101010at 32 bits, every bit flipped
Bits reversed10101010000000110111100000000000at 32 bits
Rotated left by 100000000001111011000000010101010at 32 bits, wrapping
Shifted left by 11111011000000010101010= 4,030,634, no wrap
Shifted right by 111110110000000101010= 1,007,658, discarding the low bit
These bits as a double9.95698895 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,015,317 to the power 24,061,502,610,489
2,015,317 to the power 38,185,215,256,462,860,013
2,015,317 to the power 416,495,803,455,008,961,652,819,121
2,015,317 to the power 533,244,273,131,538,295,571,274,472,476,357
First ten multiples2,015,317, 4,030,634, 6,045,951, 8,061,268, 10,076,585, 12,091,902, 14,107,219, 16,122,536, 18,137,853, 20,153,170
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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1122the total stopping time
Highest value reached6,045,9523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,015,317 → 6,045,952 → 3,022,976 → 1,511,488 → 755,744 → 377,872 → 188,936 → 94,468 → 47,234 → 23,617 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,531,700%
2,015,317% as a decimal20,153.17
2,015,317% of 1002,015,317
2,015,317% of 1,00020,153,170
As a fraction of 1002,015,317/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,317
Nerdulate something else
Nothing in mind? Surprise me · today’s page