Nerdulator> put something in

Recognised as Number

3,577,488

  • Positive
  • Even
  • Composite
  • 7 digits

3,577,488 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,577,488
Digit count7
Digit sum42
Digit product188,160
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^4 × 3 × 74,531
Distinct prime factors32, 3, 74,531
Number of divisors20
Sum of divisors σ(n)9,241,968
Aliquot sum5,664,480sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,192,480integers below n that share no factor with it
Carmichael function λ(n)149,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,192,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 74,531, 149,062, 223,593, 298,124, 447,186, 596,248, 894,372, 1,192,496, 1,788,744, 3,577,48820 in total

Arithmetic

Previous number3,577,487
Next number3,577,489
Double7,154,976
Cube45,786,195,364,695,478,272
Square root1,891.424859729≈irrational, shown to 9 decimal places
Cube root152.941752359≈
Negation-3,577,488
Reciprocal2.79525745 × 10^-7≈

Representations

Decimal3,577,488
Binary110110100101101001000022 bits
Octal15513220
Hexadecimal369690
Base 3624OEO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and seventy-seven thousand, four hundred and eighty-eight
Ordinalthree million, five hundred and seventy-seven thousand, four hundred and eighty-eighth
Scientific notation3.577488 × 10^6
Engineering notation3.577488 × 10^6

In other bases

Ternary20201202101120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1403434423base 5; one hand: 10 digits
Septenary42256665base 7: 8 digits
Nonary6652346base 9; each digit is two ternary digits: 7 digits
Duodecimal1246380base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1273e8base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:33:44:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1TT1T11TTT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111110101110010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101101001011010010000
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes336 96 90
Gray code1011011101110111011000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101101001011010010000
64-bit0000000000000000000000000000000000000000001101101001011010010000
One's complement11111111110010010110100101101111at 32 bits, every bit flipped
Bits reversed00001001011010010110110000000000at 32 bits
Rotated left by 100000000011011010010110100100000at 32 bits, wrapping
Shifted left by 111011010010110100100000= 7,154,976, no wrap
Shifted right by 1110110100101101001000= 1,788,744, discarding the low bit
These bits as a double1.76751392 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,577,501+13
Previous prime3,577,487−1
Distance to nearest prime1
Nearest square below3,575,881
Nearest square above3,579,664

Powers & multiples

3,577,488 to the power 212,798,420,390,144
3,577,488 to the power 345,786,195,364,695,478,272
3,577,488 to the power 4163,799,564,482,853,697,172,340,736
3,577,488 to the power 5585,990,976,342,635,307,389,682,914,951,168
First ten multiples3,577,488, 7,154,976, 10,732,464, 14,309,952, 17,887,440, 21,464,928, 25,042,416, 28,619,904, 32,197,392, 35,774,880
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12Yes
Divisible by 100No, remainder 88

Collatz (3n + 1) trajectory

Steps to reach 197the total stopping time
Highest value reached3,577,488
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,577,488 → 1,788,744 → 894,372 → 447,186 → 223,593 → 670,780 → 335,390 → 167,695 → 503,086 → 251,543 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage357,748,800%
3,577,488% as a decimal35,774.88
3,577,488% of 1003,577,488
3,577,488% of 1,00035,774,880
As a fraction of 1003,577,488/100

Read another way

As bytes3.412 MiB
As a 24-bit colour#369690

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3577488” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.