Number
1,064,271
- Positive
- Odd
- Composite
- 7 digits
1,064,271 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,064,271
Digit count7
Digit sum21
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 13 × 29 × 941
Distinct prime factors43, 13, 29, 941
Number of divisors16
Sum of divisors σ(n)1,582,560
Aliquot sum518,289sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)631,680integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 29, 39, 87, 377, 941, 1,131, 2,823, 12,233, 27,289, 36,699, 81,867, 354,757, 1,064,27116 in total
Arithmetic
Previous number1,064,270
Next number1,064,272
Double2,128,542
Half532,135.5
Square1,132,672,761,441
Cube1,205,470,772,491,574,511
Square root1,031.63510991≈irrational, shown to 9 decimal places
Cube root102.098041067≈
Negation-1,064,271
Reciprocal9.39610306 × 10^-7≈
Representations
Decimal1,064,271
Binary10000001111010100111121 bits
Octal4036517
Hexadecimal103D4F
Base 36MT73
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty-four thousand, two hundred and seventy-one
Ordinalone million, sixty-four thousand, two hundred and seventy-first
Scientific notation1.064271 × 10^6
Engineering notation1.064271 × 10^6
Nearest landmarks
Powers & multiples
1,064,271 to the power 21,132,672,761,441
1,064,271 to the power 31,205,470,772,491,574,511
1,064,271 to the power 41,282,947,584,510,380,496,396,481
1,064,271 to the power 51,365,403,908,714,447,161,280,379,230,351
First ten multiples1,064,271, 2,128,542, 3,192,813, 4,257,084, 5,321,355, 6,385,626, 7,449,897, 8,514,168, 9,578,439, 10,642,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1271the total stopping time
Highest value reached10,775,75210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,064,271 → 3,192,814 → 1,596,407 → 4,789,222 → 2,394,611 → 7,183,834 → 3,591,917 → 10,775,752 → 5,387,876 → 2,693,938 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,427,100%
1,064,271% as a decimal10,642.71
1,064,271% of 1001,064,271
1,064,271% of 1,00010,642,710
As a fraction of 1001,064,271/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,064,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page