Recognised as Number
3,487,560
- Positive
- Even
- Composite
- 7 digits
3,487,560 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,487,560
Digit count7
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 3 × 5 × 29,063
Distinct prime factors42, 3, 5, 29,063
Number of divisors32
Sum of divisors σ(n)10,463,040
Aliquot sum6,975,480sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)929,984integers below n that share no factor with it
Carmichael function λ(n)58,124the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 929,984
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120, 29,063, 58,126, 87,189, 116,252, 145,315, 174,378, 232,504, 290,630, 348,756, 435,945, 581,260, 697,512, 871,890, 1,162,520, 1,743,780, 3,487,56032 in total
Arithmetic
Previous number3,487,559
Next number3,487,561
Double6,975,120
Half1,743,780
Square12,163,074,753,600
Cube42,419,452,987,665,216,000
Square root1,867.501004016≈irrational, shown to 9 decimal places
Cube root151.649353308≈
Negation-3,487,560
Reciprocal2.86733418 × 10^-7≈
Representations
Decimal3,487,560
Binary110101001101110100100022 bits
Octal15233510
Hexadecimal353748
Base 3622R0O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and eighty-seven thousand, five hundred and sixty
Ordinalthree million, four hundred and eighty-seven thousand, five hundred and sixtieth
Scientific notation3.48756 × 10^6
Engineering notation3.48756 × 10^6
In other bases
Ternary20120012000220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343100220base 5; one hand: 10 digits
Septenary41433546base 7: 8 digits
Nonary6505026base 9; each digit is two ternary digits: 7 digits
Duodecimal1202320base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11fii0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:8:46:0base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT01TT0010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010100101101011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010011011101001000
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes335 37 48
Gray code1011111010110011101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010011011101001000
64-bit0000000000000000000000000000000000000000001101010011011101001000
One's complement11111111110010101100100010110111at 32 bits, every bit flipped
Bits reversed00010010111011001010110000000000at 32 bits
Rotated left by 100000000011010100110111010010000at 32 bits, wrapping
Shifted left by 111010100110111010010000= 6,975,120, no wrap
Shifted right by 1110101001101110100100= 1,743,780, discarding the low bit
These bits as a double1.72308358 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,487,560 to the power 212,163,074,753,600
3,487,560 to the power 342,419,452,987,665,216,000
3,487,560 to the power 4147,940,387,461,661,700,712,960,000
3,487,560 to the power 5515,950,977,695,792,880,938,490,777,600,000
First ten multiples3,487,560, 6,975,120, 10,462,680, 13,950,240, 17,437,800, 20,925,360, 24,412,920, 27,900,480, 31,388,040, 34,875,600
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 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12Yes
Divisible by 100No, remainder 60
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached17,896,7685× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,487,560 → 1,743,780 → 871,890 → 435,945 → 1,307,836 → 653,918 → 326,959 → 980,878 → 490,439 → 1,471,318 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage348,756,000%
3,487,560% as a decimal34,875.6
3,487,560% of 1003,487,560
3,487,560% of 1,00034,875,600
As a fraction of 1003,487,560/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,487,560
Nerdulate something else
Nothing in mind? Surprise me · today’s page