Number
1,060,133
- Positive
- Odd
- Prime
- 7 digits
1,060,133 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,060,133
Digit count7
Digit sum14
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,060,133
Distinct prime factors11,060,133
Number of divisors2
Sum of divisors σ(n)1,060,134
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,060,132integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 1,060,1332 in total
Arithmetic
Previous number1,060,132
Next number1,060,134
Double2,120,266
Half530,066.5
Square1,123,881,977,689
Cube1,191,464,372,653,372,637
Square root1,029.627602583≈irrational, shown to 9 decimal places
Cube root101.965546482≈
Negation-1,060,133
Reciprocal9.43277872 × 10^-7≈
Representations
Decimal1,060,133
Binary10000001011010010010121 bits
Octal4026445
Hexadecimal102D25
Base 36MQ05
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty thousand, one hundred and thirty-three
Ordinalone million, sixty thousand, one hundred and thirty-third
Scientific notation1.060133 × 10^6
Engineering notation1.060133 × 10^6
Nearest landmarks
Powers & multiples
1,060,133 to the power 21,123,881,977,689
1,060,133 to the power 31,191,464,372,653,372,637
1,060,133 to the power 41,263,110,699,774,137,893,780,721
1,060,133 to the power 51,339,065,335,483,656,127,747,437,095,893
First ten multiples1,060,133, 2,120,266, 3,180,399, 4,240,532, 5,300,665, 6,360,798, 7,420,931, 8,481,064, 9,541,197, 10,601,330
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached3,180,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,060,133 → 3,180,400 → 1,590,200 → 795,100 → 397,550 → 198,775 → 596,326 → 298,163 → 894,490 → 447,245 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,013,300%
1,060,133% as a decimal10,601.33
1,060,133% of 1001,060,133
1,060,133% of 1,00010,601,330
As a fraction of 1001,060,133/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,060,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page