Recognised as Number
2,003,317
- Positive
- Odd
- Composite
- 7 digits
2,003,317 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,003,317
Digit count7
Digit sum16
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 factorisation151 × 13,267
Distinct prime factors2151, 13,267
Number of divisors4
Sum of divisors σ(n)2,016,736
Aliquot sum13,419sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,989,900integers below n that share no factor with it
Carmichael function λ(n)331,650the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,989,900
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 151, 13,267, 2,003,3174 in total
Arithmetic
Previous number2,003,316
Next number2,003,318
Double4,006,634
Half1,001,658.5
Square4,013,279,002,489
Cube8,039,870,051,429,256,013
Square root1,415.385813127≈irrational, shown to 9 decimal places
Cube root126.061719154≈
Negation-2,003,317
Reciprocal4.99172123 × 10^-7≈
Representations
Decimal2,003,317
Binary11110100100010111010121 bits
Octal7510565
Hexadecimal1E9175
Base 3616XRP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three thousand, three hundred and seventeen
Ordinaltwo million, three thousand, three hundred and seventeenth
Scientific notation2.003317 × 10^6
Engineering notation2.003317 × 10^6
In other bases
Ternary10202210000221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003101232base 5; one hand: 10 digits
Septenary23012401base 7: 8 digits
Nonary3683027base 9; each digit is two ternary digits: 7 digits
Duodecimal8073b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalca85hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:16:28:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T10T100010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111001011010110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101001000101110101
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 91 75
Gray code100011101100111001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101001000101110101
64-bit0000000000000000000000000000000000000000000111101001000101110101
One's complement11111111111000010110111010001010at 32 bits, every bit flipped
Bits reversed10101110100010010111100000000000at 32 bits
Rotated left by 100000000001111010010001011101010at 32 bits, wrapping
Shifted left by 11111010010001011101010= 4,006,634, no wrap
Shifted right by 111110100100010111010= 1,001,658, discarding the low bit
These bits as a double9.89770107 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,003,317 to the power 24,013,279,002,489
2,003,317 to the power 38,039,870,051,429,256,013
2,003,317 to the power 416,106,408,351,819,102,868,195,121
2,003,317 to the power 532,266,241,660,141,189,700,604,045,216,357
First ten multiples2,003,317, 4,006,634, 6,009,951, 8,013,268, 10,016,585, 12,019,902, 14,023,219, 16,026,536, 18,029,853, 20,033,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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached6,009,9523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,003,317 → 6,009,952 → 3,004,976 → 1,502,488 → 751,244 → 375,622 → 187,811 → 563,434 → 281,717 → 845,152 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,331,700%
2,003,317% as a decimal20,033.17
2,003,317% of 1002,003,317
2,003,317% of 1,00020,033,170
As a fraction of 1002,003,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,003,317
Nerdulate something else
Nothing in mind? Surprise me · today’s page