Recognised as Number

1,288,752

Positive
Even
Composite
7 digits

1,288,752 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,288,752

Digit count7

Digit sum33

Digit product8,960

Multiplicative persistence2times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 3 × 26,849

Distinct prime factors32, 3, 26,849

Number of divisors20

Sum of divisors σ(n)3,329,400

Aliquot sum2,040,648sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)26,848the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 429,568

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 26,849, 53,698, 80,547, 107,396, 161,094, 214,792, 322,188, 429,584, 644,376, 1,288,75220 in total

Arithmetic

Previous number1,288,751

Next number1,288,753

Double2,577,504

Half644,376

Square1,660,881,717,504

Cube2,140,464,635,196,715,008

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

Cube root108.82360719≈

Negation-1,288,752

Reciprocal7.7594448 × 10^-7≈

Representations

Decimal1,288,752

Binary10011101010100011000021 bits

Octal4725060

Hexadecimal13AA30

Base 36RMEO

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

In wordsone million, two hundred and eighty-eight thousand, seven hundred and fifty-two

Ordinalone million, two hundred and eighty-eight thousand, seven hundred and fifty-second

Scientific notation1.288752 × 10^6

Engineering notation1.288752 × 10^6

In other bases

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

Quinary312220002base 5; one hand: 9 digits

Septenary13645203base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100111010101000110000

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

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

Bytes313 aa 30

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

At each machine width

32-bit00000000000100111010101000110000

64-bit0000000000000000000000000000000000000000000100111010101000110000

One's complement11111111111011000101010111001111at 32 bits, every bit flipped

Bits reversed00001100010101011100100000000000at 32 bits

Rotated left by 100000000001001110101010001100000at 32 bits, wrapping

Shifted left by 11001110101010001100000= 2,577,504, no wrap

Shifted right by 110011101010100011000= 644,376, discarding the low bit

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

Nearest landmarks

Next prime1,288,769+17

Previous prime1,288,733−19

Distance to nearest prime17

Nearest square below1,288,225

Nearest square above1,290,496

Powers & multiples

1,288,752 to the power 21,660,881,717,504

1,288,752 to the power 32,140,464,635,196,715,008

1,288,752 to the power 42,758,528,079,539,036,859,990,016

1,288,752 to the power 53,555,058,579,562,092,831,385,853,100,032

First ten multiples1,288,752, 2,577,504, 3,866,256, 5,155,008, 6,443,760, 7,732,512, 9,021,264, 10,310,016, 11,598,768, 12,887,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 3

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 3

Divisible by 12Yes

Divisible by 100No, remainder 52

Collatz (3n + 1) trajectory

Steps to reach 198the total stopping time

Highest value reached1,288,752

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

First steps1,288,752 → 644,376 → 322,188 → 161,094 → 80,547 → 241,642 → 120,821 → 362,464 → 181,232 → 90,616 → …

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

As a percentage & fraction

As a percentage128,875,200%

1,288,752% as a decimal12,887.52

1,288,752% of 1001,288,752

1,288,752% of 1,00012,887,520

As a fraction of 1001,288,752/100

Read another way

As seconds14 days, 21 hours and 59 minutes

As bytes1.229 MiB

As a 24-bit colour#13AA30

Keep nerding

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