Recognised as Number
3,371,589
- Positive
- Odd
- Composite
- 7 digits
3,371,589 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,371,589
Digit count7
Digit sum36
Digit product22,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 13 × 28,817
Distinct prime factors33, 13, 28,817
Number of divisors12
Sum of divisors σ(n)5,244,876
Aliquot sum1,873,287sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,074,752integers below n that share no factor with it
Carmichael function λ(n)86,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,074,752
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 39, 117, 28,817, 86,451, 259,353, 374,621, 1,123,863, 3,371,58912 in total
Arithmetic
Previous number3,371,588
Next number3,371,590
Double6,743,178
Half1,685,794.5
Square11,367,612,384,921
Cube38,326,916,873,263,409,469
Square root1,836.188715791≈irrational, shown to 9 decimal places
Cube root149.949449633≈
Negation-3,371,589
Reciprocal2.96596056 × 10^-7≈
Representations
Decimal3,371,589
Binary110011011100100100010122 bits
Octal14671105
Hexadecimal337245
Base 36209J9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-one thousand, five hundred and eighty-nine
Ordinalthree million, three hundred and seventy-one thousand, five hundred and eighty-ninth
Scientific notation3.371589 × 10^6
Engineering notation3.371589 × 10^6
In other bases
Ternary20100021221200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330342324base 5; one hand: 10 digits
Septenary40441464base 7: 8 digits
Nonary6307850base 9; each digit is two ternary digits: 7 digits
Duodecimal1167199base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1118j9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:36:33:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010010T00TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001011011001000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111001001000101
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 45
Gray code1010101100101101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111001001000101
64-bit0000000000000000000000000000000000000000001100110111001001000101
One's complement11111111110011001000110110111010at 32 bits, every bit flipped
Bits reversed10100010010011101100110000000000at 32 bits
Rotated left by 100000000011001101110010010001010at 32 bits, wrapping
Shifted left by 111001101110010010001010= 6,743,178, no wrap
Shifted right by 1110011011100100100010= 1,685,794, discarding the low bit
These bits as a double1.6657863 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,371,589 to the power 211,367,612,384,921
3,371,589 to the power 338,326,916,873,263,409,469
3,371,589 to the power 4129,222,611,333,809,305,468,176,241
3,371,589 to the power 5435,685,534,924,346,782,414,142,864,216,949
First ten multiples3,371,589, 6,743,178, 10,114,767, 13,486,356, 16,857,945, 20,229,534, 23,601,123, 26,972,712, 30,344,301, 33,715,890
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached10,114,7683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,371,589 → 10,114,768 → 5,057,384 → 2,528,692 → 1,264,346 → 632,173 → 1,896,520 → 948,260 → 474,130 → 237,065 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,158,900%
3,371,589% as a decimal33,715.89
3,371,589% of 1003,371,589
3,371,589% of 1,00033,715,890
As a fraction of 1003,371,589/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,589
Nerdulate something else
Nothing in mind? Surprise me · today’s page