Recognised as Number

1,131,074

Positive
Even
Composite
7 digits

1,131,074 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,131,074

Digit count7

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 173 × 467

Distinct prime factors42, 7, 173, 467

Number of divisors16

Sum of divisors σ(n)1,954,368

Aliquot sum823,294sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)120,228the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 480,912

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 7, 14, 173, 346, 467, 934, 1,211, 2,422, 3,269, 6,538, 80,791, 161,582, 565,537, 1,131,07416 in total

Arithmetic

Previous number1,131,073

Next number1,131,075

Double2,262,148

Half565,537

Square1,279,328,393,476

Cube1,447,015,083,322,473,224

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

Cube root104.191032025≈

Negation-1,131,074

Reciprocal8.84115451 × 10^-7≈

Representations

Decimal1,131,074

Binary10001010000100100001021 bits

Octal4241102

Hexadecimal114242

Base 36O8QQ

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

In wordsone million, one hundred and thirty-one thousand and seventy-four

Ordinalone million, one hundred and thirty-one thousand and seventy-fourth

Scientific notation1.131074 × 10^6

Engineering notation1.131074 × 10^6

In other bases

Ternary2010110112122base 3; the most digit-efficient integer base after e: 13 digits

Quinary242143244base 5; one hand: 9 digits

Septenary12420410base 7: 8 digits

Nonary2113478base 9; each digit is two ternary digits: 7 digits

Duodecimal466682base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal717debase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:14:11:14base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T010111TT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100010100011001000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100010100001001000010

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

Bit parityeven6 set bits, so even; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes311 42 42

Gray code110011110001101100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100010100001001000010

64-bit0000000000000000000000000000000000000000000100010100001001000010

One's complement11111111111011101011110110111101at 32 bits, every bit flipped

Bits reversed01000010010000101000100000000000at 32 bits

Rotated left by 100000000001000101000010010000100at 32 bits, wrapping

Shifted left by 11000101000010010000100= 2,262,148, no wrap

Shifted right by 110001010000100100001= 565,537, discarding the low bit

These bits as a double5.58824806 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,131,077+3

Previous prime1,131,049−25

Distance to nearest prime3

Nearest square below1,129,969

Nearest square above1,132,096

Powers & multiples

1,131,074 to the power 21,279,328,393,476

1,131,074 to the power 31,447,015,083,322,473,224

1,131,074 to the power 41,636,681,138,353,883,079,362,576

1,131,074 to the power 51,851,207,481,882,479,950,106,946,286,624

First ten multiples1,131,074, 2,262,148, 3,393,222, 4,524,296, 5,655,370, 6,786,444, 7,917,518, 9,048,592, 10,179,666, 11,310,740

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 74

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached1,696,6121× the starting value

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

First steps1,131,074 → 565,537 → 1,696,612 → 848,306 → 424,153 → 1,272,460 → 636,230 → 318,115 → 954,346 → 477,173 → …

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

As a percentage & fraction

As a percentage113,107,400%

1,131,074% as a decimal11,310.74

1,131,074% of 1001,131,074

1,131,074% of 1,00011,310,740

As a fraction of 1001,131,074/100

Read another way

As seconds13 days, 2 hours and 11 minutes

As bytes1.079 MiB

As a 24-bit colour#114242

Keep nerding

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