Recognised as Number

3,491,966

Positive
Even
Composite
7 digits

3,491,966 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,491,966

Digit count7

Digit sum38

Digit product34,992

Multiplicative persistence5times 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 × 677 × 2,579

Distinct prime factors32, 677, 2,579

Number of divisors8

Sum of divisors σ(n)5,247,720

Aliquot sum1,755,754sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)871,364the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,742,728

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 677, 1,354, 2,579, 5,158, 1,745,983, 3,491,9668 in total

Arithmetic

Previous number3,491,965

Next number3,491,967

Double6,983,932

Half1,745,983

Square12,193,826,545,156

Cube42,580,427,705,582,216,696

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

Cube root151.713188375≈

Negation-3,491,966

Reciprocal2.86371631 × 10^-7≈

Representations

Decimal3,491,966

Binary110101010010000111111022 bits

Octal15244176

Hexadecimal35487E

Base 3622UF2

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

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

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

Scientific notation3.491966 × 10^6

Engineering notation3.491966 × 10^6

In other bases

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

Quinary1343220331base 5; one hand: 10 digits

Septenary41452442base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001101010100100001111110

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 even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes335 48 7e

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

At each machine width

32-bit00000000001101010100100001111110

64-bit0000000000000000000000000000000000000000001101010100100001111110

One's complement11111111110010101011011110000001at 32 bits, every bit flipped

Bits reversed01111110000100101010110000000000at 32 bits

Rotated left by 100000000011010101001000011111100at 32 bits, wrapping

Shifted left by 111010101001000011111100= 6,983,932, no wrap

Shifted right by 1110101010010000111111= 1,745,983, discarding the low bit

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

Nearest landmarks

Next prime3,491,981+15

Previous prime3,491,963−3

Distance to nearest prime3

Nearest square below3,489,424

Nearest square above3,493,161

Powers & multiples

3,491,966 to the power 212,193,826,545,156

3,491,966 to the power 342,580,427,705,582,216,696

3,491,966 to the power 4148,689,405,813,351,110,907,064,336

3,491,966 to the power 5519,218,349,660,424,425,349,697,821,124,576

First ten multiples3,491,966, 6,983,932, 10,475,898, 13,967,864, 17,459,830, 20,951,796, 24,443,762, 27,935,728, 31,427,694, 34,919,660

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 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 2

Divisible by 10No, remainder 6

Divisible by 11No, remainder 5

Divisible by 12No, remainder 2

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 1128the total stopping time

Highest value reached39,775,69611× the starting value

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

First steps3,491,966 → 1,745,983 → 5,237,950 → 2,618,975 → 7,856,926 → 3,928,463 → 11,785,390 → 5,892,695 → 17,678,086 → 8,839,043 → …

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

As a percentage & fraction

As a percentage349,196,600%

3,491,966% as a decimal34,919.66

3,491,966% of 1003,491,966

3,491,966% of 1,00034,919,660

As a fraction of 1003,491,966/100

Read another way

As seconds40 days, 9 hours and 59 minutes

As bytes3.33 MiB

As a 24-bit colour#35487E

Keep nerding

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