Recognised as Number

3,491,968

Positive
Even
Composite
7 digits

3,491,968 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,491,968

Digit count7

Digit sum40

Digit product46,656

Multiplicative persistence3times 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^7 × 27,281

Distinct prime factors22, 27,281

Number of divisors16

Sum of divisors σ(n)6,956,910

Aliquot sum3,464,942sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 64, 128, 27,281, 54,562, 109,124, 218,248, 436,496, 872,992, 1,745,984, 3,491,96816 in total

Arithmetic

Previous number3,491,967

Next number3,491,969

Double6,983,936

Half1,745,984

Square12,193,840,513,024

Cube42,580,500,868,583,391,232

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

Cube root151.713217339≈

Negation-3,491,968

Reciprocal2.86371467 × 10^-7≈

Representations

Decimal3,491,968

Binary110101010010001000000022 bits

Octal15244200

Hexadecimal354880

Base 3622UF4

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

In wordsthree million, four hundred and ninety-one thousand, nine hundred and sixty-eight

Ordinalthree million, four hundred and ninety-one thousand, nine hundred and sixty-eighth

Scientific notation3.491968 × 10^6

Engineering notation3.491968 × 10^6

In other bases

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

Quinary1343220333base 5; one hand: 10 digits

Septenary41452444base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001101010100100010000000

Bit length22 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 77 trailing zeros

Power of twoNo

Bytes335 48 80

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

At each machine width

32-bit00000000001101010100100010000000

64-bit0000000000000000000000000000000000000000001101010100100010000000

One's complement11111111110010101011011101111111at 32 bits, every bit flipped

Bits reversed00000001000100101010110000000000at 32 bits

Rotated left by 100000000011010101001000100000000at 32 bits, wrapping

Shifted left by 111010101001000100000000= 6,983,936, no wrap

Shifted right by 1110101010010001000000= 1,745,984, discarding the low bit

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

Nearest landmarks

Next prime3,491,981+13

Previous prime3,491,963−5

Distance to nearest prime5

Nearest square below3,489,424

Nearest square above3,493,161

Powers & multiples

3,491,968 to the power 212,193,840,513,024

3,491,968 to the power 342,580,500,868,583,391,232

3,491,968 to the power 4148,689,746,457,065,407,513,624,576

3,491,968 to the power 5519,219,836,556,185,776,944,536,583,405,568

First ten multiples3,491,968, 6,983,936, 10,475,904, 13,967,872, 17,459,840, 20,951,808, 24,443,776, 27,935,744, 31,427,712, 34,919,680

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 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 8

Divisible by 11No, remainder 7

Divisible by 12No, remainder 4

Divisible by 100No, remainder 68

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time

Highest value reached3,491,968

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

First steps3,491,968 → 1,745,984 → 872,992 → 436,496 → 218,248 → 109,124 → 54,562 → 27,281 → 81,844 → 40,922 → …

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

As a percentage & fraction

As a percentage349,196,800%

3,491,968% as a decimal34,919.68

3,491,968% of 1003,491,968

3,491,968% of 1,00034,919,680

As a fraction of 1003,491,968/100

Read another way

As seconds40 days, 9 hours and 59 minutes

As bytes3.33 MiB

As a 24-bit colour#354880

Keep nerding

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