Recognised as Number

1,033,522

Positive
Even
Composite
7 digits

1,033,522 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,033,522

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 73,823

Distinct prime factors32, 7, 73,823

Number of divisors8

Sum of divisors σ(n)1,771,776

Aliquot sum738,254sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)221,466the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 442,932

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 7, 14, 73,823, 147,646, 516,761, 1,033,5228 in total

Arithmetic

Previous number1,033,521

Next number1,033,523

Double2,067,044

Half516,761

Square1,068,167,724,484

Cube1,103,974,842,944,152,648

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

Cube root101.105141628≈

Negation-1,033,522

Reciprocal9.67565277 × 10^-7≈

Representations

Decimal1,033,522

Binary1111110001010011001020 bits

Octal3742462

HexadecimalFC532

Base 36M5GY

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

In wordsone million, thirty-three thousand, five hundred and twenty-two

Ordinalone million, thirty-three thousand, five hundred and twenty-second

Scientific notation1.033522 × 10^6

Engineering notation1.033522 × 10^6

In other bases

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

Quinary231033042base 5; one hand: 9 digits

Septenary11533120base 7: 8 digits

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

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

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

Sexagesimal4:47:5:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011111100010100110010

Bit length20 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes30f c5 32

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

At each machine width

32-bit00000000000011111100010100110010

64-bit0000000000000000000000000000000000000000000011111100010100110010

One's complement11111111111100000011101011001101at 32 bits, every bit flipped

Bits reversed01001100101000111111000000000000at 32 bits

Rotated left by 100000000000111111000101001100100at 32 bits, wrapping

Shifted left by 1111111000101001100100= 2,067,044, no wrap

Shifted right by 11111110001010011001= 516,761, discarding the low bit

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

Nearest landmarks

Next prime1,033,537+15

Previous prime1,033,517−5

Distance to nearest prime5

Nearest square below1,032,256

Nearest square above1,034,289

Powers & multiples

1,033,522 to the power 21,068,167,724,484

1,033,522 to the power 31,103,974,842,944,152,648

1,033,522 to the power 41,140,982,287,629,326,533,066,256

1,033,522 to the power 51,179,230,295,875,236,817,107,703,033,632

First ten multiples1,033,522, 2,067,044, 3,100,566, 4,134,088, 5,167,610, 6,201,132, 7,234,654, 8,268,176, 9,301,698, 10,335,220

Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7Yes

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10No, remainder 2

Divisible by 11No, remainder 6

Divisible by 12No, remainder 10

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1196the total stopping time

Highest value reached1,744,0721× the starting value

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

First steps1,033,522 → 516,761 → 1,550,284 → 775,142 → 387,571 → 1,162,714 → 581,357 → 1,744,072 → 872,036 → 436,018 → …

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

As a percentage & fraction

As a percentage103,352,200%

1,033,522% as a decimal10,335.22

1,033,522% of 1001,033,522

1,033,522% of 1,00010,335,220

As a fraction of 1001,033,522/100

Read another way

As seconds11 days, 23 hours and 5 minutes

As bytes1,009.299 KiB

As a 24-bit colour#0FC532

Keep nerding

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