Number
1,466,709
- Positive
- Odd
- Composite
- 7 digits
1,466,709 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,466,709
Digit count7
Digit sum33
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 17 × 28,759
Distinct prime factors33, 17, 28,759
Number of divisors8
Sum of divisors σ(n)2,070,720
Aliquot sum604,011sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)920,256integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 28,759, 86,277, 488,903, 1,466,7098 in total
Arithmetic
Previous number1,466,708
Next number1,466,710
Double2,933,418
Half733,354.5
Square2,151,235,290,681
Cube3,155,236,161,959,438,829
Square root1,211.077619313≈irrational, shown to 9 decimal places
Cube root113.618221181≈
Negation-1,466,709
Reciprocal6.81798503 × 10^-7≈
Representations
Decimal1,466,709
Binary10110011000010101010121 bits
Octal5460525
Hexadecimal166155
Base 36VFPX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and sixty-six thousand, seven hundred and nine
Ordinalone million, four hundred and sixty-six thousand, seven hundred and ninth
Scientific notation1.466709 × 10^6
Engineering notation1.466709 × 10^6
Nearest landmarks
Powers & multiples
1,466,709 to the power 22,151,235,290,681
1,466,709 to the power 33,155,236,161,959,438,829
1,466,709 to the power 44,627,813,275,871,366,565,443,761
1,466,709 to the power 56,787,655,382,040,016,183,835,453,252,549
First ten multiples1,466,709, 2,933,418, 4,400,127, 5,866,836, 7,333,545, 8,800,254, 10,266,963, 11,733,672, 13,200,381, 14,667,090
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 136the total stopping time
Highest value reached4,400,1283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,466,709 → 4,400,128 → 2,200,064 → 1,100,032 → 550,016 → 275,008 → 137,504 → 68,752 → 34,376 → 17,188 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage146,670,900%
1,466,709% as a decimal14,667.09
1,466,709% of 1001,466,709
1,466,709% of 1,00014,667,090
As a fraction of 1001,466,709/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,466,709
Nerdulate something else
Nothing in mind? Surprise me · today’s page