Recognised as Number

3,550,654

Positive
Even
Composite
7 digits

3,550,654 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,550,654

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 × 17^2 × 6,143

Distinct prime factors32, 17, 6,143

Number of divisors12

Sum of divisors σ(n)5,658,624

Aliquot sum2,107,970sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)835,312the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,670,624

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 17, 34, 289, 578, 6,143, 12,286, 104,431, 208,862, 1,775,327, 3,550,65412 in total

Arithmetic

Previous number3,550,653

Next number3,550,655

Double7,101,308

Half1,775,327

Square12,607,143,827,716

Cube44,763,605,660,455,126,264

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

Cube root152.558397414≈

Negation-3,550,654

Reciprocal2.81638256 × 10^-7≈

Representations

Decimal3,550,654

Binary110110001011011011111022 bits

Octal15426676

Hexadecimal362DBE

Base 36243PA

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

In wordsthree million, five hundred and fifty thousand, six hundred and fifty-four

Ordinalthree million, five hundred and fifty thousand, six hundred and fifty-fourth

Scientific notation3.550654 × 10^6

Engineering notation3.550654 × 10^6

In other bases

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

Quinary1402110104base 5; one hand: 10 digits

Septenary42115522base 7: 8 digits

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

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

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

Sexagesimal16:26:17:34base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001101100010110110111110

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

Bytes336 2d be

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

At each machine width

32-bit00000000001101100010110110111110

64-bit0000000000000000000000000000000000000000001101100010110110111110

One's complement11111111110010011101001001000001at 32 bits, every bit flipped

Bits reversed01111101101101000110110000000000at 32 bits

Rotated left by 100000000011011000101101101111100at 32 bits, wrapping

Shifted left by 111011000101101101111100= 7,101,308, no wrap

Shifted right by 1110110001011011011111= 1,775,327, discarding the low bit

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

Nearest landmarks

Next prime3,550,667+13

Previous prime3,550,649−5

Distance to nearest prime5

Nearest square below3,549,456

Nearest square above3,553,225

Powers & multiples

3,550,654 to the power 212,607,143,827,716

3,550,654 to the power 344,763,605,660,455,126,264

3,550,654 to the power 4158,940,075,492,717,635,889,776,656

3,550,654 to the power 5564,341,214,808,519,844,742,579,042,733,024

First ten multiples3,550,654, 7,101,308, 10,651,962, 14,202,616, 17,753,270, 21,303,924, 24,854,578, 28,405,232, 31,955,886, 35,506,540

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

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 1

Divisible by 10No, remainder 4

Divisible by 11No, remainder 8

Divisible by 12No, remainder 10

Divisible by 100No, remainder 54

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time

Highest value reached26,962,7927× the starting value

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

First steps3,550,654 → 1,775,327 → 5,325,982 → 2,662,991 → 7,988,974 → 3,994,487 → 11,983,462 → 5,991,731 → 17,975,194 → 8,987,597 → …

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

As a percentage & fraction

As a percentage355,065,400%

3,550,654% as a decimal35,506.54

3,550,654% of 1003,550,654

3,550,654% of 1,00035,506,540

As a fraction of 1003,550,654/100

Read another way

As seconds41 days, 2 hours and 17 minutes

As bytes3.386 MiB

As a 24-bit colour#362DBE

Keep nerding

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