Recognised as Number

3,387,549

Positive
Odd
Composite
7 digits

3,387,549 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,387,549

Digit count7

Digit sum39

Digit product90,720

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 102,653

Distinct prime factors33, 11, 102,653

Number of divisors8

Sum of divisors σ(n)4,927,392

Aliquot sum1,539,843sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,053,040integers below n that share no factor with it

Carmichael function λ(n)513,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,053,040

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 102,653, 307,959, 1,129,183, 3,387,5498 in total

Arithmetic

Previous number3,387,548

Next number3,387,550

Double6,775,098

Half1,693,774.5

Square11,475,488,227,401

Cube38,873,778,669,244,030,149

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

Cube root150.185681166≈

Negation-3,387,549

Reciprocal2.95198682 × 10^-7≈

Representations

Decimal3,387,549

Binary110011101100001001110122 bits

Octal14730235

Hexadecimal33B09D

Base 3620LUL

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

In wordsthree million, three hundred and eighty-seven thousand, five hundred and forty-nine

Ordinalthree million, three hundred and eighty-seven thousand, five hundred and forty-ninth

Scientific notation3.387549 × 10^6

Engineering notation3.387549 × 10^6

In other bases

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

Quinary1331400144base 5; one hand: 10 digits

Septenary40536144base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001100111011000010011101

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes333 b0 9d

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

At each machine width

32-bit00000000001100111011000010011101

64-bit0000000000000000000000000000000000000000001100111011000010011101

One's complement11111111110011000100111101100010at 32 bits, every bit flipped

Bits reversed10111001000011011100110000000000at 32 bits

Rotated left by 100000000011001110110000100111010at 32 bits, wrapping

Shifted left by 111001110110000100111010= 6,775,098, no wrap

Shifted right by 1110011101100001001110= 1,693,774, discarding the low bit

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

Nearest landmarks

Next prime3,387,551+2

Previous prime3,387,541−8

Distance to nearest prime2

Nearest square below3,385,600

Nearest square above3,389,281

Powers & multiples

3,387,549 to the power 211,475,488,227,401

3,387,549 to the power 338,873,778,669,244,030,149

3,387,549 to the power 4131,686,830,057,218,945,087,214,801

3,387,549 to the power 5446,095,589,473,501,980,211,249,411,912,749

First ten multiples3,387,549, 6,775,098, 10,162,647, 13,550,196, 16,937,745, 20,325,294, 23,712,843, 27,100,392, 30,487,941, 33,875,490

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1128the total stopping time

Highest value reached10,162,6483× the starting value

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

First steps3,387,549 → 10,162,648 → 5,081,324 → 2,540,662 → 1,270,331 → 3,810,994 → 1,905,497 → 5,716,492 → 2,858,246 → 1,429,123 → …

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

As a percentage & fraction

As a percentage338,754,900%

3,387,549% as a decimal33,875.49

3,387,549% of 1003,387,549

3,387,549% of 1,00033,875,490

As a fraction of 1003,387,549/100

Read another way

As seconds39 days, 4 hours and 59 minutes

As bytes3.231 MiB

As a 24-bit colour#33B09D

Keep nerding

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