Recognised as Number

1,068,678

Positive
Even
Composite
7 digits

1,068,678 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,068,678

Digit count7

Digit sum36

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 13 × 4,567

Distinct prime factors42, 3, 13, 4,567

Number of divisors24

Sum of divisors σ(n)2,494,128

Aliquot sum1,425,450sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)9,132the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 328,752

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 13, 18, 26, 39, 78, 117, 234, 4,567, 9,134, 13,701, 27,402, 41,103, 59,371, 82,206, 118,742, 178,113, 356,226, 534,339, 1,068,67824 in total

Arithmetic

Previous number1,068,677

Next number1,068,679

Double2,137,356

Half534,339

Square1,142,072,667,684

Cube1,220,507,934,355,201,752

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

Cube root102.23877165≈

Negation-1,068,678

Reciprocal9.35735554 × 10^-7≈

Representations

Decimal1,068,678

Binary10000010011101000011021 bits

Octal4047206

Hexadecimal104E86

Base 36MWLI

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

In wordsone million, sixty-eight thousand, six hundred and seventy-eight

Ordinalone million, sixty-eight thousand, six hundred and seventy-eighth

Scientific notation1.068678 × 10^6

Engineering notation1.068678 × 10^6

In other bases

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

Quinary233144203base 5; one hand: 9 digits

Septenary12040452base 7: 8 digits

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

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

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

Sexagesimal4:56:51:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000100111010000110

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 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

Bytes310 4e 86

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

At each machine width

32-bit00000000000100000100111010000110

64-bit0000000000000000000000000000000000000000000100000100111010000110

One's complement11111111111011111011000101111001at 32 bits, every bit flipped

Bits reversed01100001011100100000100000000000at 32 bits

Rotated left by 100000000001000001001110100001100at 32 bits, wrapping

Shifted left by 11000001001110100001100= 2,137,356, no wrap

Shifted right by 110000010011101000011= 534,339, discarding the low bit

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

Nearest landmarks

Next prime1,068,701+23

Previous prime1,068,677−1

Distance to nearest prime1

Nearest square below1,067,089

Nearest square above1,069,156

Powers & multiples

1,068,678 to the power 21,142,072,667,684

1,068,678 to the power 31,220,507,934,355,201,752

1,068,678 to the power 41,304,329,978,270,848,297,923,856

1,068,678 to the power 51,393,908,752,518,533,617,328,670,582,368

First ten multiples1,068,678, 2,137,356, 3,206,034, 4,274,712, 5,343,390, 6,412,068, 7,480,746, 8,549,424, 9,618,102, 10,686,780

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6Yes

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9Yes

Divisible by 10No, remainder 8

Divisible by 11No, remainder 6

Divisible by 12No, remainder 6

Divisible by 100No, remainder 78

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached3,084,8562× the starting value

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

First steps1,068,678 → 534,339 → 1,603,018 → 801,509 → 2,404,528 → 1,202,264 → 601,132 → 300,566 → 150,283 → 450,850 → …

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

As a percentage & fraction

As a percentage106,867,800%

1,068,678% as a decimal10,686.78

1,068,678% of 1001,068,678

1,068,678% of 1,00010,686,780

As a fraction of 1001,068,678/100

Read another way

As seconds12 days, 8 hours and 51 minutes

As bytes1.019 MiB

As a 24-bit colour#104E86

Keep nerding

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