Number

1,060,137

Positive
Odd
Composite
7 digits

1,060,137 is an odd 7-digit integer and a composite number. It has 36 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,060,137

Digit count7

Digit sum18

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 13^2 × 17 × 41

Distinct prime factors43, 13, 17, 41

Number of divisors36

Sum of divisors σ(n)1,798,524

Aliquot sum738,387sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)599,040integers below n that share no factor with it

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 13, 17, 39, 41, 51, 117, 123, 153, 169, 221, 369, 507, 533, 663, 697, 1,521, 1,599, 1,989, 2,091, 2,873, 4,797, 6,273, 6,929, 8,619, 9,061, 20,787, 25,857, 27,183, 62,361, 81,549, 117,793, 353,379, 1,060,13736 in total

Arithmetic

Previous number1,060,136

Next number1,060,138

Double2,120,274

Half530,068.5

Square1,123,890,458,769

Cube1,191,477,859,287,991,353

Square root1,029.629545031≈irrational, shown to 9 decimal places

Cube root101.965674725≈

Negation-1,060,137

Reciprocal9.43274313 × 10^-7≈

Representations

Decimal1,060,137

Binary10000001011010010100121 bits

Octal4026451

Hexadecimal102D29

Base 36MQ09

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, sixty thousand, one hundred and thirty-seven

Ordinalone million, sixty thousand, one hundred and thirty-seventh

Scientific notation1.060137 × 10^6

Engineering notation1.060137 × 10^6

Nearest landmarks

Next prime1,060,151+14

Previous prime1,060,133−4

Distance to nearest prime4

Nearest square below1,058,841

Nearest square above1,060,900

Powers & multiples

1,060,137 to the power 21,123,890,458,769

1,060,137 to the power 31,191,477,859,287,991,353

1,060,137 to the power 41,263,129,763,311,993,288,995,361

1,060,137 to the power 51,339,090,597,888,286,629,415,675,024,457

First ten multiples1,060,137, 2,120,274, 3,180,411, 4,240,548, 5,300,685, 6,360,822, 7,420,959, 8,481,096, 9,541,233, 10,601,370

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 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached15,283,24014× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,060,137 → 3,180,412 → 1,590,206 → 795,103 → 2,385,310 → 1,192,655 → 3,577,966 → 1,788,983 → 5,366,950 → 2,683,475 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage106,013,700%

1,060,137% as a decimal10,601.37

1,060,137% of 1001,060,137

1,060,137% of 1,00010,601,370

As a fraction of 1001,060,137/100

Read another way

As seconds12 days, 6 hours and 28 minutes

As bytes1.011 MiB

As a 24-bit colour#102D29

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.