Recognised as Number

1,087,635

Positive
Odd
Composite
7 digits

1,087,635 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,087,635

Digit count7

Digit sum30

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 31 × 2,339

Distinct prime factors43, 5, 31, 2,339

Number of divisors16

Sum of divisors σ(n)1,797,120

Aliquot sum709,485sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 31, 93, 155, 465, 2,339, 7,017, 11,695, 35,085, 72,509, 217,527, 362,545, 1,087,63516 in total

Arithmetic

Previous number1,087,634

Next number1,087,636

Double2,175,270

Half543,817.5

Square1,182,949,893,225

Cube1,286,617,707,117,772,875

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

Cube root102.839760897≈

Negation-1,087,635

Reciprocal9.19426094 × 10^-7≈

Representations

Decimal1,087,635

Binary10000100110001001001121 bits

Octal4114223

Hexadecimal109893

Base 36NB83

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

In wordsone million, eighty-seven thousand, six hundred and thirty-five

Ordinalone million, eighty-seven thousand, six hundred and thirty-fifth

Scientific notation1.087635 × 10^6

Engineering notation1.087635 × 10^6

In other bases

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

Quinary234301020base 5; one hand: 9 digits

Septenary12146643base 7: 8 digits

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

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

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

Sexagesimal5:2:7:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001001100010010011

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes310 98 93

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

At each machine width

32-bit00000000000100001001100010010011

64-bit0000000000000000000000000000000000000000000100001001100010010011

One's complement11111111111011110110011101101100at 32 bits, every bit flipped

Bits reversed11001001000110010000100000000000at 32 bits

Rotated left by 100000000001000010011000100100110at 32 bits, wrapping

Shifted left by 11000010011000100100110= 2,175,270, no wrap

Shifted right by 110000100110001001001= 543,817, discarding the low bit

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

Nearest landmarks

Next prime1,087,657+22

Previous prime1,087,631−4

Distance to nearest prime4

Nearest square below1,085,764

Nearest square above1,087,849

Powers & multiples

1,087,635 to the power 21,182,949,893,225

1,087,635 to the power 31,286,617,707,117,772,875

1,087,635 to the power 41,399,370,449,881,038,900,900,625

1,087,635 to the power 51,522,004,279,256,363,744,981,051,271,875

First ten multiples1,087,635, 2,175,270, 3,262,905, 4,350,540, 5,438,175, 6,525,810, 7,613,445, 8,701,080, 9,788,715, 10,876,350

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 5Yes

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1196the total stopping time

Highest value reached4,894,3604× the starting value

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

First steps1,087,635 → 3,262,906 → 1,631,453 → 4,894,360 → 2,447,180 → 1,223,590 → 611,795 → 1,835,386 → 917,693 → 2,753,080 → …

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

As a percentage & fraction

As a percentage108,763,500%

1,087,635% as a decimal10,876.35

1,087,635% of 1001,087,635

1,087,635% of 1,00010,876,350

As a fraction of 1001,087,635/100

Read another way

As seconds12 days, 14 hours and 7 minutes

As bytes1.037 MiB

As a 24-bit colour#109893

Keep nerding

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