Recognised as Number

3,407,260

Positive
Even
Composite
7 digits

3,407,260 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,407,260

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 170,363

Distinct prime factors32, 5, 170,363

Number of divisors12

Sum of divisors σ(n)7,155,288

Aliquot sum3,748,028sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)340,724the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,362,896

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 170,363, 340,726, 681,452, 851,815, 1,703,630, 3,407,26012 in total

Arithmetic

Previous number3,407,259

Next number3,407,261

Double6,814,520

Half1,703,630

Square11,609,420,707,600

Cube39,556,314,800,177,176,000

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

Cube root150.476411206≈

Negation-3,407,260

Reciprocal2.93490958 × 10^-7≈

Representations

Decimal3,407,260

Binary110011111111011001110022 bits

Octal14776634

Hexadecimal33FD9C

Base 3621124

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

In wordsthree million, four hundred and seven thousand, two hundred and sixty

Ordinalthree million, four hundred and seven thousand, two hundred and sixtieth

Scientific notation3.40726 × 10^6

Engineering notation3.40726 × 10^6

In other bases

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

Quinary1333013020base 5; one hand: 10 digits

Septenary40650463base 7: 8 digits

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

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

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

Sexagesimal15:46:27:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001100111111110110011100

Bit length22 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits7within that length

Bit parityodd15 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 fd 9c

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

At each machine width

32-bit00000000001100111111110110011100

64-bit0000000000000000000000000000000000000000001100111111110110011100

One's complement11111111110011000000001001100011at 32 bits, every bit flipped

Bits reversed00111001101111111100110000000000at 32 bits

Rotated left by 100000000011001111111101100111000at 32 bits, wrapping

Shifted left by 111001111111101100111000= 6,814,520, no wrap

Shifted right by 1110011111111011001110= 1,703,630, discarding the low bit

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

Nearest landmarks

Next prime3,407,267+7

Previous prime3,407,221−39

Distance to nearest prime7

Nearest square below3,404,025

Nearest square above3,407,716

Powers & multiples

3,407,260 to the power 211,609,420,707,600

3,407,260 to the power 339,556,314,800,177,176,000

3,407,260 to the power 4134,778,649,166,051,684,697,760,000

3,407,260 to the power 5459,225,900,157,521,263,203,289,737,600,000

First ten multiples3,407,260, 6,814,520, 10,221,780, 13,629,040, 17,036,300, 20,443,560, 23,850,820, 27,258,080, 30,665,340, 34,072,600

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 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 4

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time

Highest value reached139,876,93641× the starting value

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

First steps3,407,260 → 1,703,630 → 851,815 → 2,555,446 → 1,277,723 → 3,833,170 → 1,916,585 → 5,749,756 → 2,874,878 → 1,437,439 → …

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

As a percentage & fraction

As a percentage340,726,000%

3,407,260% as a decimal34,072.6

3,407,260% of 1003,407,260

3,407,260% of 1,00034,072,600

As a fraction of 1003,407,260/100

Read another way

As seconds39 days, 10 hours and 27 minutes

As bytes3.249 MiB

As a 24-bit colour#33FD9C

Keep nerding

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