Recognised as Number

1,139,571

Positive
Odd
Composite
7 digits

1,139,571 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,139,571

Digit count7

Digit sum27

Digit product945

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 127 × 997

Distinct prime factors33, 127, 997

Number of divisors12

Sum of divisors σ(n)1,660,672

Aliquot sum521,101sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 127, 381, 997, 1,143, 2,991, 8,973, 126,619, 379,857, 1,139,57112 in total

Arithmetic

Previous number1,139,570

Next number1,139,572

Double2,279,142

Half569,785.5

Square1,298,622,064,041

Cube1,479,872,044,141,266,411

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

Cube root104.451287171≈

Negation-1,139,571

Reciprocal8.77523208 × 10^-7≈

Representations

Decimal1,139,571

Binary10001011000110111001121 bits

Octal4261563

Hexadecimal116373

Base 36OFAR

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

In wordsone million, one hundred and thirty-nine thousand, five hundred and seventy-one

Ordinalone million, one hundred and thirty-nine thousand, five hundred and seventy-first

Scientific notation1.139571 × 10^6

Engineering notation1.139571 × 10^6

In other bases

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

Quinary242431241base 5; one hand: 9 digits

Septenary12454236base 7: 8 digits

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

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

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

Sexagesimal5:16:32:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100010110001101110011

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

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

Bytes311 63 73

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

At each machine width

32-bit00000000000100010110001101110011

64-bit0000000000000000000000000000000000000000000100010110001101110011

One's complement11111111111011101001110010001100at 32 bits, every bit flipped

Bits reversed11001110110001101000100000000000at 32 bits

Rotated left by 100000000001000101100011011100110at 32 bits, wrapping

Shifted left by 11000101100011011100110= 2,279,142, no wrap

Shifted right by 110001011000110111001= 569,785, discarding the low bit

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

Nearest landmarks

Next prime1,139,573+2

Previous prime1,139,557−14

Distance to nearest prime2

Nearest square below1,138,489

Nearest square above1,140,624

Powers & multiples

1,139,571 to the power 21,298,622,064,041

1,139,571 to the power 31,479,872,044,141,266,411

1,139,571 to the power 41,686,419,265,214,107,105,249,681

1,139,571 to the power 51,921,794,488,479,305,248,036,484,226,851

First ten multiples1,139,571, 2,279,142, 3,418,713, 4,558,284, 5,697,855, 6,837,426, 7,976,997, 9,116,568, 10,256,139, 11,395,710

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 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 177the total stopping time

Highest value reached5,128,0724× the starting value

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

First steps1,139,571 → 3,418,714 → 1,709,357 → 5,128,072 → 2,564,036 → 1,282,018 → 641,009 → 1,923,028 → 961,514 → 480,757 → …

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

As a percentage & fraction

As a percentage113,957,100%

1,139,571% as a decimal11,395.71

1,139,571% of 1001,139,571

1,139,571% of 1,00011,395,710

As a fraction of 1001,139,571/100

Read another way

As seconds13 days, 4 hours and 32 minutes

As bytes1.087 MiB

As a 24-bit colour#116373

Keep nerding

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