Recognised as Number

3,402,676

Positive
Even
Composite
7 digits

3,402,676 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,402,676

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 43 × 73 × 271

Distinct prime factors42, 43, 73, 271

Number of divisors24

Sum of divisors σ(n)6,199,424

Aliquot sum2,796,748sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 43, 73, 86, 146, 172, 271, 292, 542, 1,084, 3,139, 6,278, 11,653, 12,556, 19,783, 23,306, 39,566, 46,612, 79,132, 850,669, 1,701,338, 3,402,67624 in total

Arithmetic

Previous number3,402,675

Next number3,402,677

Double6,805,352

Half1,701,338

Square11,578,203,960,976

Cube39,396,876,741,117,971,776

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

Cube root150.408899145≈

Negation-3,402,676

Reciprocal2.93886341 × 10^-7≈

Representations

Decimal3,402,676

Binary110011111010111011010022 bits

Octal14765664

Hexadecimal33EBB4

Base 3620XIS

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

In wordsthree million, four hundred and two thousand, six hundred and seventy-six

Ordinalthree million, four hundred and two thousand, six hundred and seventy-sixth

Scientific notation3.402676 × 10^6

Engineering notation3.402676 × 10^6

In other bases

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

Quinary1332341201base 5; one hand: 10 digits

Septenary40631224base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001100111110101110110100

Bit length22 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits8within that length

Bit parityeven14 set bits, so even; 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 eb b4

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

At each machine width

32-bit00000000001100111110101110110100

64-bit0000000000000000000000000000000000000000001100111110101110110100

One's complement11111111110011000001010001001011at 32 bits, every bit flipped

Bits reversed00101101110101111100110000000000at 32 bits

Rotated left by 100000000011001111101011101101000at 32 bits, wrapping

Shifted left by 111001111101011101101000= 6,805,352, no wrap

Shifted right by 1110011111010111011010= 1,701,338, discarding the low bit

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

Nearest landmarks

Next prime3,402,677+1

Previous prime3,402,673−3

Distance to nearest prime1

Nearest square below3,400,336

Nearest square above3,404,025

Powers & multiples

3,402,676 to the power 211,578,203,960,976

3,402,676 to the power 339,396,876,741,117,971,776

3,402,676 to the power 4134,054,806,961,960,335,730,872,576

3,402,676 to the power 5456,145,074,334,095,347,343,382,573,413,376

First ten multiples3,402,676, 6,805,352, 10,208,028, 13,610,704, 17,013,380, 20,416,056, 23,818,732, 27,221,408, 30,624,084, 34,026,760

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 7No, remainder 4

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 2

Divisible by 12No, remainder 4

Divisible by 100No, remainder 76

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time

Highest value reached3,402,676

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

First steps3,402,676 → 1,701,338 → 850,669 → 2,552,008 → 1,276,004 → 638,002 → 319,001 → 957,004 → 478,502 → 239,251 → …

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

As a percentage & fraction

As a percentage340,267,600%

3,402,676% as a decimal34,026.76

3,402,676% of 1003,402,676

3,402,676% of 1,00034,026,760

As a fraction of 1003,402,676/100

Read another way

As seconds39 days, 9 hours and 11 minutes

As bytes3.245 MiB

As a 24-bit colour#33EBB4

Keep nerding

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