Recognised as Number

1,078,143

Positive
Odd
Composite
7 digits

1,078,143 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,078,143

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 37 × 883

Distinct prime factors43, 11, 37, 883

Number of divisors16

Sum of divisors σ(n)1,612,416

Aliquot sum534,273sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 635,040

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 37, 111, 407, 883, 1,221, 2,649, 9,713, 29,139, 32,671, 98,013, 359,381, 1,078,14316 in total

Arithmetic

Previous number1,078,142

Next number1,078,144

Double2,156,286

Half539,071.5

Square1,162,392,328,449

Cube1,253,225,152,170,990,207

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

Cube root102.539718892≈

Negation-1,078,143

Reciprocal9.27520746 × 10^-7≈

Representations

Decimal1,078,143

Binary10000011100110111111121 bits

Octal4071577

Hexadecimal10737F

Base 36N3WF

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

In wordsone million, seventy-eight thousand, one hundred and forty-three

Ordinalone million, seventy-eight thousand, one hundred and forty-third

Scientific notation1.078143 × 10^6

Engineering notation1.078143 × 10^6

In other bases

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

Quinary234000033base 5; one hand: 9 digits

Septenary12110163base 7: 8 digits

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

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

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

Sexagesimal4:59:29:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000111001101111111

Bit length21 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits8within that length

Bit parityodd13 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes310 73 7f

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

At each machine width

32-bit00000000000100000111001101111111

64-bit0000000000000000000000000000000000000000000100000111001101111111

One's complement11111111111011111000110010000000at 32 bits, every bit flipped

Bits reversed11111110110011100000100000000000at 32 bits

Rotated left by 100000000001000001110011011111110at 32 bits, wrapping

Shifted left by 11000001110011011111110= 2,156,286, no wrap

Shifted right by 110000011100110111111= 539,071, discarding the low bit

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

Nearest landmarks

Next prime1,078,151+8

Previous prime1,078,127−16

Distance to nearest prime8

Nearest square below1,077,444

Nearest square above1,079,521

Powers & multiples

1,078,143 to the power 21,162,392,328,449

1,078,143 to the power 31,253,225,152,170,990,207

1,078,143 to the power 41,351,155,925,237,087,894,745,601

1,078,143 to the power 51,456,739,302,702,889,654,104,706,498,943

First ten multiples1,078,143, 2,156,286, 3,234,429, 4,312,572, 5,390,715, 6,468,858, 7,547,001, 8,625,144, 9,703,287, 10,781,430

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 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1315the total stopping time

Highest value reached67,296,72462× the starting value

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

First steps1,078,143 → 3,234,430 → 1,617,215 → 4,851,646 → 2,425,823 → 7,277,470 → 3,638,735 → 10,916,206 → 5,458,103 → 16,374,310 → …

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

As a percentage & fraction

As a percentage107,814,300%

1,078,143% as a decimal10,781.43

1,078,143% of 1001,078,143

1,078,143% of 1,00010,781,430

As a fraction of 1001,078,143/100

Read another way

As seconds12 days, 11 hours and 29 minutes

As bytes1.028 MiB

As a 24-bit colour#10737F

Keep nerding

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