Recognised as Number

1,185,552

Positive
Even
Composite
7 digits

1,185,552 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,185,552

Digit count7

Digit sum27

Digit product2,000

Multiplicative persistence2times 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^4 × 3^2 × 8,233

Distinct prime factors32, 3, 8,233

Number of divisors30

Sum of divisors σ(n)3,318,302

Aliquot sum2,132,750sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 8,233, 16,466, 24,699, 32,932, 49,398, 65,864, 74,097, 98,796, 131,728, 148,194, 197,592, 296,388, 395,184, 592,776, 1,185,55230 in total

Arithmetic

Previous number1,185,551

Next number1,185,553

Double2,371,104

Half592,776

Square1,405,533,544,704

Cube1,666,333,104,990,916,608

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

Cube root105.837653463≈

Negation-1,185,552

Reciprocal8.4348894 × 10^-7≈

Representations

Decimal1,185,552

Binary10010000101110001000021 bits

Octal4413420

Hexadecimal121710

Base 36PES0

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

In wordsone million, one hundred and eighty-five thousand, five hundred and fifty-two

Ordinalone million, one hundred and eighty-five thousand, five hundred and fifty-second

Scientific notation1.185552 × 10^6

Engineering notation1.185552 × 10^6

In other bases

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

Quinary300414202base 5; one hand: 9 digits

Septenary13035264base 7: 8 digits

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

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

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

Sexagesimal5:29:19:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100100001011100010000

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes312 17 10

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

At each machine width

32-bit00000000000100100001011100010000

64-bit0000000000000000000000000000000000000000000100100001011100010000

One's complement11111111111011011110100011101111at 32 bits, every bit flipped

Bits reversed00001000111010000100100000000000at 32 bits

Rotated left by 100000000001001000010111000100000at 32 bits, wrapping

Shifted left by 11001000010111000100000= 2,371,104, no wrap

Shifted right by 110010000101110001000= 592,776, discarding the low bit

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

Nearest landmarks

Next prime1,185,559+7

Previous prime1,185,551−1

Distance to nearest prime1

Nearest square below1,183,744

Nearest square above1,185,921

Powers & multiples

1,185,552 to the power 21,405,533,544,704

1,185,552 to the power 31,666,333,104,990,916,608

1,185,552 to the power 41,975,524,545,288,191,166,447,616

1,185,552 to the power 52,342,087,075,715,505,613,764,304,044,032

First ten multiples1,185,552, 2,371,104, 3,556,656, 4,742,208, 5,927,760, 7,113,312, 8,298,864, 9,484,416, 10,669,968, 11,855,520

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 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9Yes

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12Yes

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached1,185,552

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

First steps1,185,552 → 592,776 → 296,388 → 148,194 → 74,097 → 222,292 → 111,146 → 55,573 → 166,720 → 83,360 → …

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

As a percentage & fraction

As a percentage118,555,200%

1,185,552% as a decimal11,855.52

1,185,552% of 1001,185,552

1,185,552% of 1,00011,855,520

As a fraction of 1001,185,552/100

Read another way

As seconds13 days, 17 hours and 19 minutes

As bytes1.131 MiB

As a 24-bit colour#121710

Keep nerding

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