Number
1,049,965
- Positive
- Odd
- Composite
- 7 digits
1,049,965 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,049,965
Digit count7
Digit sum34
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 131 × 229
Distinct prime factors45, 7, 131, 229
Number of divisors16
Sum of divisors σ(n)1,457,280
Aliquot sum407,315sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)711,360integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 131, 229, 655, 917, 1,145, 1,603, 4,585, 8,015, 29,999, 149,995, 209,993, 1,049,96516 in total
Arithmetic
Previous number1,049,964
Next number1,049,966
Double2,099,930
Half524,982.5
Square1,102,426,501,225
Cube1,157,509,241,358,707,125
Square root1,024.677998202≈irrational, shown to 9 decimal places
Cube root101.63850634≈
Negation-1,049,965
Reciprocal9.52412699 × 10^-7≈
Representations
Decimal1,049,965
Binary10000000001010110110121 bits
Octal4002555
Hexadecimal10056D
Base 36MI5P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-nine thousand, nine hundred and sixty-five
Ordinalone million, forty-nine thousand, nine hundred and sixty-fifth
Scientific notation1.049965 × 10^6
Engineering notation1.049965 × 10^6
Nearest landmarks
Powers & multiples
1,049,965 to the power 21,102,426,501,225
1,049,965 to the power 31,157,509,241,358,707,125
1,049,965 to the power 41,215,344,190,603,194,926,500,625
1,049,965 to the power 51,276,068,863,086,683,561,003,228,728,125
First ten multiples1,049,965, 2,099,930, 3,149,895, 4,199,860, 5,249,825, 6,299,790, 7,349,755, 8,399,720, 9,449,685, 10,499,650
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached3,149,8963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,049,965 → 3,149,896 → 1,574,948 → 787,474 → 393,737 → 1,181,212 → 590,606 → 295,303 → 885,910 → 442,955 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,996,500%
1,049,965% as a decimal10,499.65
1,049,965% of 1001,049,965
1,049,965% of 1,00010,499,650
As a fraction of 1001,049,965/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,965
Nerdulate something else
Nothing in mind? Surprise me · today’s page