Recognised as Number

1,158,720

Positive
Even
Composite
7 digits

1,158,720 is an even 7-digit integer and a composite number. It has 112 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,158,720

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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^6 × 3 × 5 × 17 × 71

Distinct prime factors52, 3, 5, 17, 71

Number of divisors112

Sum of divisors σ(n)3,950,208

Aliquot sum2,791,488sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 286,720

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 30, 32, 34, 40, 48, 51, 60, 64, 68, 71, 80, 85, 96, 102, 120, 136, 142, 160, 170, 192, 204, 213, 240, 255, 272, 284, 320, 340, 355, 408, 426, 480, 510, 544, 568, 680, 710, 816, 852, 960, 1,020, 1,065, 1,088, 1,136, 1,207, 1,360, 1,420, 1,632, 1,704, 2,040, 2,130, 2,272, 2,414, 2,720, 2,840, 3,264, 3,408, 3,621, 4,080, 4,260, 4,544, 4,828, 5,440, 5,680, 6,035, 6,816, 7,242, 8,160, 8,520, 9,656, 11,360, 12,070, 13,632, 14,484, 16,320, 17,040, 18,105, 19,312, 22,720, 24,140, 28,968, 34,080, 36,210, 38,624, 48,280, 57,936, 68,160, 72,420, 77,248, 96,560, 115,872, 144,840, 193,120, 231,744, 289,680, 386,240, 579,360, 1,158,720112 in total

Arithmetic

Previous number1,158,719

Next number1,158,721

Double2,317,440

Half579,360

Square1,342,632,038,400

Cube1,555,734,595,534,848,000

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

Cube root105.033096143≈

Negation-1,158,720

Reciprocal8.63021265 × 10^-7≈

Representations

Decimal1,158,720

Binary10001101011100100000021 bits

Octal4327100

Hexadecimal11AE40

Base 36OU2O

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

In wordsone million, one hundred and fifty-eight thousand, seven hundred and twenty

Ordinalone million, one hundred and fifty-eight thousand, seven hundred and twentieth

Scientific notation1.15872 × 10^6

Engineering notation1.15872 × 10^6

In other bases

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

Quinary244034340base 5; one hand: 9 digits

Septenary12564123base 7: 8 digits

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

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

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

Sexagesimal5:21:52:0base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100011010111001000000

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 66 trailing zeros

Power of twoNo

Bytes311 ae 40

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

At each machine width

32-bit00000000000100011010111001000000

64-bit0000000000000000000000000000000000000000000100011010111001000000

One's complement11111111111011100101000110111111at 32 bits, every bit flipped

Bits reversed00000010011101011000100000000000at 32 bits

Rotated left by 100000000001000110101110010000000at 32 bits, wrapping

Shifted left by 11000110101110010000000= 2,317,440, no wrap

Shifted right by 110001101011100100000= 579,360, discarding the low bit

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

Nearest landmarks

Next prime1,158,743+23

Previous prime1,158,719−1

Distance to nearest prime1

Nearest square below1,157,776

Nearest square above1,159,929

Powers & multiples

1,158,720 to the power 21,342,632,038,400

1,158,720 to the power 31,555,734,595,534,848,000

1,158,720 to the power 41,802,660,790,538,139,074,560,000

1,158,720 to the power 52,088,779,111,212,352,508,474,163,200,000

First ten multiples1,158,720, 2,317,440, 3,476,160, 4,634,880, 5,793,600, 6,952,320, 8,111,040, 9,269,760, 10,428,480, 11,587,200

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10Yes

Divisible by 11No, remainder 2

Divisible by 12Yes

Divisible by 100No, remainder 20

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time

Highest value reached1,158,720

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

First steps1,158,720 → 579,360 → 289,680 → 144,840 → 72,420 → 36,210 → 18,105 → 54,316 → 27,158 → 13,579 → …

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

As a percentage & fraction

As a percentage115,872,000%

1,158,720% as a decimal11,587.2

1,158,720% of 1001,158,720

1,158,720% of 1,00011,587,200

As a fraction of 1001,158,720/100

Read another way

As seconds13 days, 9 hours and 52 minutes

As bytes1.105 MiB

As a 24-bit colour#11AE40

Keep nerding

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