Number
1,000,001
- Positive
- Odd
- Composite
- 7 digits
1,000,001 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,000,001
Digit count7
Digit sum2
Digital root2repeated digit sum
PalindromicYesreads the same backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation101 × 9,901
Distinct prime factors2101, 9,901
Number of divisors4
Sum of divisors σ(n)1,010,004
Aliquot sum10,003sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)990,000integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 101, 9,901, 1,000,0014 in total
Arithmetic
Previous number1,000,000
Next number1,000,002
Double2,000,002
Half500,000.5
Square1,000,002,000,001
Cube1,000,003,000,003,000,001
Square root1,000.0005≈irrational, shown to 9 decimal places
Cube root100.000033333≈
Negation-1,000,001
Reciprocal9.99999 × 10^-7≈
Representations
Decimal1,000,001
Binary1111010000100100000120 bits
Octal3641101
HexadecimalF4241
Base 36LFLT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million and one
Ordinalone million and first
Scientific notation1.000001 × 10^6
Engineering notation1.000001 × 10^6
Nearest landmarks
Powers & multiples
1,000,001 to the power 21,000,002,000,001
1,000,001 to the power 31,000,003,000,003,000,001
1,000,001 to the power 41,000,004,000,006,000,004,000,001
1,000,001 to the power 51,000,005,000,010,000,010,000,005,000,001
First ten multiples1,000,001, 2,000,002, 3,000,003, 4,000,004, 5,000,005, 6,000,006, 7,000,007, 8,000,008, 9,000,009, 10,000,010
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1113the total stopping time
Highest value reached3,000,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,000,001 → 3,000,004 → 1,500,002 → 750,001 → 2,250,004 → 1,125,002 → 562,501 → 1,687,504 → 843,752 → 421,876 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,000,100%
1,000,001% as a decimal10,000.01
1,000,001% of 1001,000,001
1,000,001% of 1,00010,000,010
As a fraction of 1001,000,001/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 1,000,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page