Number
1,049,601
- Positive
- Odd
- Composite
- 7 digits
1,049,601 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,049,601
Digit count7
Digit sum21
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 151 × 331
Distinct prime factors43, 7, 151, 331
Number of divisors16
Sum of divisors σ(n)1,614,848
Aliquot sum565,247sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)594,000integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 151, 331, 453, 993, 1,057, 2,317, 3,171, 6,951, 49,981, 149,943, 349,867, 1,049,60116 in total
Arithmetic
Previous number1,049,600
Next number1,049,602
Double2,099,202
Half524,800.5
Square1,101,662,259,201
Cube1,156,305,808,919,628,801
Square root1,024.500366032≈irrational, shown to 9 decimal places
Cube root101.626759697≈
Negation-1,049,601
Reciprocal9.52742995 × 10^-7≈
Representations
Decimal1,049,601
Binary10000000001000000000121 bits
Octal4002001
Hexadecimal100401
Base 36MHVL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand, six hundred and one
Ordinalone million, forty-nine thousand, six hundred and first
Scientific notation1.049601 × 10^6
Engineering notation1.049601 × 10^6
Nearest landmarks
Powers & multiples
1,049,601 to the power 21,101,662,259,201
1,049,601 to the power 31,156,305,808,919,628,801
1,049,601 to the power 41,213,659,733,347,851,309,158,401
1,049,601 to the power 51,273,858,469,781,638,081,943,966,848,001
First ten multiples1,049,601, 2,099,202, 3,148,803, 4,198,404, 5,248,005, 6,297,606, 7,347,207, 8,396,808, 9,446,409, 10,496,010
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached3,148,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,601 → 3,148,804 → 1,574,402 → 787,201 → 2,361,604 → 1,180,802 → 590,401 → 1,771,204 → 885,602 → 442,801 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,960,100%
1,049,601% as a decimal10,496.01
1,049,601% of 1001,049,601
1,049,601% of 1,00010,496,010
As a fraction of 1001,049,601/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,049,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page