Recognised as Number
3,371,587
- Positive
- Odd
- Composite
- 7 digits
3,371,587 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,371,587
Digit count7
Digit sum34
Digit product17,640
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation43 × 89 × 881
Distinct prime factors343, 89, 881
Number of divisors8
Sum of divisors σ(n)3,492,720
Aliquot sum121,133sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,252,480integers below n that share no factor with it
Carmichael function λ(n)18,480the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,252,480
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 43, 89, 881, 3,827, 37,883, 78,409, 3,371,5878 in total
Arithmetic
Previous number3,371,586
Next number3,371,588
Double6,743,174
Half1,685,793.5
Square11,367,598,898,569
Cube38,326,848,667,629,559,003
Square root1,836.188171185≈irrational, shown to 9 decimal places
Cube root149.949419983≈
Negation-3,371,587
Reciprocal2.96596232 × 10^-7≈
Representations
Decimal3,371,587
Binary110011011100100100001122 bits
Octal14671103
Hexadecimal337243
Base 36209J7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-one thousand, five hundred and eighty-seven
Ordinalthree million, three hundred and seventy-one thousand, five hundred and eighty-seventh
Scientific notation3.371587 × 10^6
Engineering notation3.371587 × 10^6
In other bases
Ternary20100021221121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330342322base 5; one hand: 10 digits
Septenary40441462base 7: 8 digits
Nonary6307847base 9; each digit is two ternary digits: 7 digits
Duodecimal1167197base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1118j7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:36:33:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010010T00TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001011011001000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111001001000011
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 72 43
Gray code1010101100101101100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111001001000011
64-bit0000000000000000000000000000000000000000001100110111001001000011
One's complement11111111110011001000110110111100at 32 bits, every bit flipped
Bits reversed11000010010011101100110000000000at 32 bits
Rotated left by 100000000011001101110010010000110at 32 bits, wrapping
Shifted left by 111001101110010010000110= 6,743,174, no wrap
Shifted right by 1110011011100100100001= 1,685,793, discarding the low bit
These bits as a double1.66578531 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,371,587 to the power 211,367,598,898,569
3,371,587 to the power 338,326,848,667,629,559,003
3,371,587 to the power 4129,222,304,718,747,141,950,247,761
3,371,587 to the power 5435,684,242,699,766,520,086,609,997,766,707
First ten multiples3,371,587, 6,743,174, 10,114,761, 13,486,348, 16,857,935, 20,229,522, 23,601,109, 26,972,696, 30,344,283, 33,715,870
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached15,172,1444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,371,587 → 10,114,762 → 5,057,381 → 15,172,144 → 7,586,072 → 3,793,036 → 1,896,518 → 948,259 → 2,844,778 → 1,422,389 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,158,700%
3,371,587% as a decimal33,715.87
3,371,587% of 1003,371,587
3,371,587% of 1,00033,715,870
As a fraction of 1003,371,587/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,371,587
Nerdulate something else
Nothing in mind? Surprise me · today’s page