Recognised as Number

3,363,556

Positive
Even
Composite
Perfect square
7 digits

3,363,556 is an even 7-digit integer and a composite number. It has 27 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,363,556

Digit count7

Digit sum31

Digit product24,300

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,834²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7^2 × 131^2

Distinct prime factors32, 7, 131

Number of divisors27

Sum of divisors σ(n)6,899,907

Aliquot sum3,536,351sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)1,430,520integers below n that share no factor with it

Carmichael function λ(n)357,630the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,430,520

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7, 14, 28, 49, 98, 131, 196, 262, 524, 917, 1,834, 3,668, 6,419, 12,838, 17,161, 25,676, 34,322, 68,644, 120,127, 240,254, 480,508, 840,889, 1,681,778, 3,363,55627 in total

Arithmetic

Previous number3,363,555

Next number3,363,557

Double6,727,112

Half1,681,778

Square11,313,508,965,136

Cube38,053,620,960,736,983,616

Square root1,834exact

Cube root149.83026727≈

Negation-3,363,556

Reciprocal2.973044 × 10^-7≈

Representations

Decimal3,363,556

Binary110011010100101110010022 bits

Octal14651344

Hexadecimal3352E4

Base 36203C4

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

In wordsthree million, three hundred and sixty-three thousand, five hundred and fifty-six

Ordinalthree million, three hundred and sixty-three thousand, five hundred and fifty-sixth

Scientific notation3.363556 × 10^6

Engineering notation3.363556 × 10^6

In other bases

Ternary20022212221011base 3; the most digit-efficient integer base after e: 14 digits

Quinary1330113211base 5; one hand: 10 digits

Septenary40406200base 7: 8 digits

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

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

Vigesimal1108hgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal15:34:19:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001100110101001011100100

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes333 52 e4

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

At each machine width

32-bit00000000001100110101001011100100

64-bit0000000000000000000000000000000000000000001100110101001011100100

One's complement11111111110011001010110100011011at 32 bits, every bit flipped

Bits reversed00100111010010101100110000000000at 32 bits

Rotated left by 100000000011001101010010111001000at 32 bits, wrapping

Shifted left by 111001101010010111001000= 6,727,112, no wrap

Shifted right by 1110011010100101110010= 1,681,778, discarding the low bit

These bits as a double1.66181747 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,363,571+15

Previous prime3,363,541−15

Distance to nearest prime15

Nearest square below3,363,556

Nearest square above3,367,225

Powers & multiples

3,363,556 to the power 211,313,508,965,136

3,363,556 to the power 338,053,620,960,736,983,616

3,363,556 to the power 4127,995,485,104,212,645,663,498,496

3,363,556 to the power 5430,519,981,895,185,069,597,334,347,211,776

First ten multiples3,363,556, 6,727,112, 10,090,668, 13,454,224, 16,817,780, 20,181,336, 23,544,892, 26,908,448, 30,272,004, 33,635,560

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 4

Divisible by 10No, remainder 6

Divisible by 11No, remainder 9

Divisible by 12No, remainder 4

Divisible by 100No, remainder 56

Collatz (3n + 1) trajectory

Steps to reach 1208the total stopping time

Highest value reached3,363,556

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

First steps3,363,556 → 1,681,778 → 840,889 → 2,522,668 → 1,261,334 → 630,667 → 1,892,002 → 946,001 → 2,838,004 → 1,419,002 → …

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

As a percentage & fraction

As a percentage336,355,600%

3,363,556% as a decimal33,635.56

3,363,556% of 1003,363,556

3,363,556% of 1,00033,635,560

As a fraction of 1003,363,556/100

Read another way

As seconds38 days, 22 hours and 19 minutes

As bytes3.208 MiB

As a 24-bit colour#3352E4

Keep nerding

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