Recognised as Number
3,671,572
- Positive
- Even
- Composite
- 7 digits
3,671,572 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,671,572
Digit count7
Digit sum31
Digit product8,820
Multiplicative persistence2times 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^2 × 917,893
Distinct prime factors22, 917,893
Number of divisors6
Sum of divisors σ(n)6,425,258
Aliquot sum2,753,686sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,835,784integers below n that share no factor with it
Carmichael function λ(n)917,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,835,784
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 917,893, 1,835,786, 3,671,5726 in total
Arithmetic
Previous number3,671,571
Next number3,671,573
Double7,343,144
Half1,835,786
Square13,480,440,951,184
Cube49,494,409,544,020,541,248
Square root1,916.134650801≈irrational, shown to 9 decimal places
Cube root154.270901151≈
Negation-3,671,572
Reciprocal2.72362901 × 10^-7≈
Representations
Decimal3,671,572
Binary111000000001100001010022 bits
Octal16003024
Hexadecimal380614
Base 3626P04
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventy-one thousand, five hundred and seventy-two
Ordinalthree million, six hundred and seventy-one thousand, five hundred and seventy-second
Scientific notation3.671572 × 10^6
Engineering notation3.671572 × 10^6
In other bases
Ternary20220112110011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1414442242base 5; one hand: 10 digits
Septenary43131202base 7: 8 digits
Nonary6815404base 9; each digit is two ternary digits: 7 digits
Duodecimal1290904base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12iiicbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:59:52:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T1TTT110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000001101000010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110000000011000010100
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 22 trailing zeros
Power of twoNo
Bytes338 06 14
Gray code1001000000010100011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110000000011000010100
64-bit0000000000000000000000000000000000000000001110000000011000010100
One's complement11111111110001111111100111101011at 32 bits, every bit flipped
Bits reversed00101000011000000001110000000000at 32 bits
Rotated left by 100000000011100000000110000101000at 32 bits, wrapping
Shifted left by 111100000000110000101000= 7,343,144, no wrap
Shifted right by 1111000000001100001010= 1,835,786, discarding the low bit
These bits as a double1.81399759 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,671,572 to the power 213,480,440,951,184
3,671,572 to the power 349,494,409,544,020,541,248
3,671,572 to the power 4181,722,288,238,358,586,671,001,856
3,671,572 to the power 5667,206,465,271,886,712,780,823,626,437,632
First ten multiples3,671,572, 7,343,144, 11,014,716, 14,686,288, 18,357,860, 22,029,432, 25,701,004, 29,372,576, 33,044,148, 36,715,720
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 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached3,671,572
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,671,572 → 1,835,786 → 917,893 → 2,753,680 → 1,376,840 → 688,420 → 344,210 → 172,105 → 516,316 → 258,158 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage367,157,200%
3,671,572% as a decimal36,715.72
3,671,572% of 1003,671,572
3,671,572% of 1,00036,715,720
As a fraction of 1003,671,572/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,671,572
Nerdulate something else
Nothing in mind? Surprise me · today’s page