Number
1,360,133
- Positive
- Odd
- Composite
- 7 digits
1,360,133 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,360,133
Digit count7
Digit sum17
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation43 × 47 × 673
Distinct prime factors343, 47, 673
Number of divisors8
Sum of divisors σ(n)1,423,488
Aliquot sum63,355sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,298,304integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 43, 47, 673, 2,021, 28,939, 31,631, 1,360,1338 in total
Arithmetic
Previous number1,360,132
Next number1,360,134
Double2,720,266
Half680,066.5
Square1,849,961,777,689
Cube2,516,194,062,573,472,637
Square root1,166.247400855≈irrational, shown to 9 decimal places
Cube root110.796776657≈
Negation-1,360,133
Reciprocal7.35222217 × 10^-7≈
Representations
Decimal1,360,133
Binary10100110000010000010121 bits
Octal5140405
Hexadecimal14C105
Base 36T5HH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty thousand, one hundred and thirty-three
Ordinalone million, three hundred and sixty thousand, one hundred and thirty-third
Scientific notation1.360133 × 10^6
Engineering notation1.360133 × 10^6
Nearest landmarks
Powers & multiples
1,360,133 to the power 21,849,961,777,689
1,360,133 to the power 32,516,194,062,573,472,637
1,360,133 to the power 43,422,358,578,910,245,058,180,721
1,360,133 to the power 54,654,862,841,008,928,341,718,518,595,893
First ten multiples1,360,133, 2,720,266, 4,080,399, 5,440,532, 6,800,665, 8,160,798, 9,520,931, 10,881,064, 12,241,197, 13,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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached4,080,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,360,133 → 4,080,400 → 2,040,200 → 1,020,100 → 510,050 → 255,025 → 765,076 → 382,538 → 191,269 → 573,808 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,013,300%
1,360,133% as a decimal13,601.33
1,360,133% of 1001,360,133
1,360,133% of 1,00013,601,330
As a fraction of 1001,360,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,360,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page