Recognised as Number

3,671,574

Positive
Even
Composite
7 digits

3,671,574 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,671,574

Digit count7

Digit sum33

Digit product17,640

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 29 × 21,101

Distinct prime factors42, 3, 29, 21,101

Number of divisors16

Sum of divisors σ(n)7,596,720

Aliquot sum3,925,146sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)147,700the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,181,600

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 29, 58, 87, 174, 21,101, 42,202, 63,303, 126,606, 611,929, 1,223,858, 1,835,787, 3,671,57416 in total

Arithmetic

Previous number3,671,573

Next number3,671,575

Double7,343,148

Half1,835,787

Square13,480,455,637,476

Cube49,494,490,426,710,307,224

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

Cube root154.270929163≈

Negation-3,671,574

Reciprocal2.72362752 × 10^-7≈

Representations

Decimal3,671,574

Binary111000000001100001011022 bits

Octal16003026

Hexadecimal380616

Base 3626P06

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

In wordsthree million, six hundred and seventy-one thousand, five hundred and seventy-four

Ordinalthree million, six hundred and seventy-one thousand, five hundred and seventy-fourth

Scientific notation3.671574 × 10^6

Engineering notation3.671574 × 10^6

In other bases

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

Quinary1414442244base 5; one hand: 10 digits

Septenary43131204base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001110000000011000010110

Bit length22 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits14within that length

Bit parityeven8 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

Bytes338 06 16

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

At each machine width

32-bit00000000001110000000011000010110

64-bit0000000000000000000000000000000000000000001110000000011000010110

One's complement11111111110001111111100111101001at 32 bits, every bit flipped

Bits reversed01101000011000000001110000000000at 32 bits

Rotated left by 100000000011100000000110000101100at 32 bits, wrapping

Shifted left by 111100000000110000101100= 7,343,148, no wrap

Shifted right by 1111000000001100001011= 1,835,787, discarding the low bit

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

Nearest landmarks

Next prime3,671,587+13

Previous prime3,671,573−1

Distance to nearest prime1

Nearest square below3,671,056

Nearest square above3,674,889

Powers & multiples

3,671,574 to the power 213,480,455,637,476

3,671,574 to the power 349,494,490,426,710,307,224

3,671,574 to the power 4181,722,684,193,958,469,535,650,576

3,671,574 to the power 5667,208,282,496,748,873,826,886,727,926,624

First ten multiples3,671,574, 7,343,148, 11,014,722, 14,686,296, 18,357,870, 22,029,444, 25,701,018, 29,372,592, 33,044,166, 36,715,740

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 5

Divisible by 12No, remainder 6

Divisible by 100No, remainder 74

Collatz (3n + 1) trajectory

Steps to reach 1110the total stopping time

Highest value reached8,261,0442× the starting value

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

First steps3,671,574 → 1,835,787 → 5,507,362 → 2,753,681 → 8,261,044 → 4,130,522 → 2,065,261 → 6,195,784 → 3,097,892 → 1,548,946 → …

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

As a percentage & fraction

As a percentage367,157,400%

3,671,574% as a decimal36,715.74

3,671,574% of 1003,671,574

3,671,574% of 1,00036,715,740

As a fraction of 1003,671,574/100

Read another way

As seconds42 days, 11 hours and 52 minutes

As bytes3.501 MiB

As a 24-bit colour#380616

Keep nerding

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