Number
2,560,001
- Positive
- Odd
- Composite
- 7 digits
2,560,001 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,560,001
Digit count7
Digit sum14
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation769 × 3,329
Distinct prime factors2769, 3,329
Number of divisors4
Sum of divisors σ(n)2,564,100
Aliquot sum4,099sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,555,904integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 769, 3,329, 2,560,0014 in total
Arithmetic
Previous number2,560,000
Next number2,560,002
Double5,120,002
Half1,280,000.5
Square6,553,605,120,001
Cube16,777,235,660,807,680,001
Square root1,600.0003125≈irrational, shown to 9 decimal places
Cube root136.798093546≈
Negation-2,560,001
Reciprocal3.90624847 × 10^-7≈
Representations
Decimal2,560,001
Binary100111000100000000000122 bits
Octal11610001
Hexadecimal271001
Base 361IVB5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and sixty thousand and one
Ordinaltwo million, five hundred and sixty thousand and first
Scientific notation2.560001 × 10^6
Engineering notation2.560001 × 10^6
Nearest landmarks
Powers & multiples
2,560,001 to the power 26,553,605,120,001
2,560,001 to the power 316,777,235,660,807,680,001
2,560,001 to the power 442,949,740,068,903,321,610,240,001
2,560,001 to the power 5109,951,377,526,132,572,225,536,012,800,001
First ten multiples2,560,001, 5,120,002, 7,680,003, 10,240,004, 12,800,005, 15,360,006, 17,920,007, 20,480,008, 23,040,009, 25,600,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 173the total stopping time
Highest value reached7,680,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,560,001 → 7,680,004 → 3,840,002 → 1,920,001 → 5,760,004 → 2,880,002 → 1,440,001 → 4,320,004 → 2,160,002 → 1,080,001 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage256,000,100%
2,560,001% as a decimal25,600.01
2,560,001% of 1002,560,001
2,560,001% of 1,00025,600,010
As a fraction of 1002,560,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 2,560,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page