Recognised as Number

3,003,518

Positive
Even
Composite
7 digits

3,003,518 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,003,518

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 7 × 61 × 3,517

Distinct prime factors42, 7, 61, 3,517

Number of divisors16

Sum of divisors σ(n)5,234,784

Aliquot sum2,231,266sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)17,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,265,760

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 7, 14, 61, 122, 427, 854, 3,517, 7,034, 24,619, 49,238, 214,537, 429,074, 1,501,759, 3,003,51816 in total

Arithmetic

Previous number3,003,517

Next number3,003,519

Double6,007,036

Half1,501,759

Square9,021,120,376,324

Cube27,095,097,430,455,907,832

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

Cube root144.281310942≈

Negation-3,003,518

Reciprocal3.32942902 × 10^-7≈

Representations

Decimal3,003,518

Binary101101110101000111111022 bits

Octal13352176

Hexadecimal2DD47E

Base 361SDJ2

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

In wordsthree million, three thousand, five hundred and eighteen

Ordinalthree million, three thousand, five hundred and eighteenth

Scientific notation3.003518 × 10^6

Engineering notation3.003518 × 10^6

In other bases

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

Quinary1232103033base 5; one hand: 10 digits

Septenary34346420base 7: 8 digits

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

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

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

Sexagesimal13:54:18:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001011011101010001111110

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 11 trailing zero

Power of twoNo

Bytes32d d4 7e

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

At each machine width

32-bit00000000001011011101010001111110

64-bit0000000000000000000000000000000000000000001011011101010001111110

One's complement11111111110100100010101110000001at 32 bits, every bit flipped

Bits reversed01111110001010111011010000000000at 32 bits

Rotated left by 100000000010110111010100011111100at 32 bits, wrapping

Shifted left by 110110111010100011111100= 6,007,036, no wrap

Shifted right by 1101101110101000111111= 1,501,759, discarding the low bit

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

Nearest landmarks

Next prime3,003,527+9

Previous prime3,003,499−19

Distance to nearest prime9

Nearest square below3,003,289

Nearest square above3,006,756

Powers & multiples

3,003,518 to the power 29,021,120,376,324

3,003,518 to the power 327,095,097,430,455,907,832

3,003,518 to the power 481,380,612,844,128,067,379,752,976

3,003,518 to the power 5244,428,135,528,369,844,680,300,898,969,568

First ten multiples3,003,518, 6,007,036, 9,010,554, 12,014,072, 15,017,590, 18,021,108, 21,024,626, 24,028,144, 27,031,662, 30,035,180

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 1

Divisible by 12No, remainder 2

Divisible by 100No, remainder 18

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time

Highest value reached34,211,96811× the starting value

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

First steps3,003,518 → 1,501,759 → 4,505,278 → 2,252,639 → 6,757,918 → 3,378,959 → 10,136,878 → 5,068,439 → 15,205,318 → 7,602,659 → …

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

As a percentage & fraction

As a percentage300,351,800%

3,003,518% as a decimal30,035.18

3,003,518% of 1003,003,518

3,003,518% of 1,00030,035,180

As a fraction of 1003,003,518/100

Read another way

As seconds34 days, 18 hours and 18 minutes

As bytes2.864 MiB

As a 24-bit colour#2DD47E

Keep nerding

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