Number
1,339,701
- Positive
- Odd
- Composite
- 7 digits
1,339,701 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,339,701
Digit count7
Digit sum24
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 40,597
Distinct prime factors33, 11, 40,597
Number of divisors8
Sum of divisors σ(n)1,948,704
Aliquot sum609,003sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)811,920integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 40,597, 121,791, 446,567, 1,339,7018 in total
Arithmetic
Previous number1,339,700
Next number1,339,702
Double2,679,402
Half669,850.5
Square1,794,798,769,401
Cube2,404,493,706,165,289,101
Square root1,157.454534744≈irrational, shown to 9 decimal places
Cube root110.239176544≈
Negation-1,339,701
Reciprocal7.46435212 × 10^-7≈
Representations
Decimal1,339,701
Binary10100011100010011010121 bits
Octal5070465
Hexadecimal147135
Base 36SPPX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and thirty-nine thousand, seven hundred and one
Ordinalone million, three hundred and thirty-nine thousand, seven hundred and first
Scientific notation1.339701 × 10^6
Engineering notation1.339701 × 10^6
Nearest landmarks
Powers & multiples
1,339,701 to the power 21,794,798,769,401
1,339,701 to the power 32,404,493,706,165,289,101
1,339,701 to the power 43,221,302,622,643,343,973,898,801
1,339,701 to the power 54,315,582,344,857,910,565,176,197,598,501
First ten multiples1,339,701, 2,679,402, 4,019,103, 5,358,804, 6,698,505, 8,038,206, 9,377,907, 10,717,608, 12,057,309, 13,397,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 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Highest value reached4,019,1043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,339,701 → 4,019,104 → 2,009,552 → 1,004,776 → 502,388 → 251,194 → 125,597 → 376,792 → 188,396 → 94,198 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage133,970,100%
1,339,701% as a decimal13,397.01
1,339,701% of 1001,339,701
1,339,701% of 1,00013,397,010
As a fraction of 1001,339,701/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,339,701
Nerdulate something else
Nothing in mind? Surprise me · today’s page