Recognised as Number
3,607,359
- Positive
- Odd
- Composite
- 7 digits
3,607,359 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,607,359
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 factorisation3 × 7 × 19 × 9,041
Distinct prime factors43, 7, 19, 9,041
Number of divisors16
Sum of divisors σ(n)5,786,880
Aliquot sum2,179,521sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,952,640integers below n that share no factor with it
Carmichael function λ(n)81,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,952,640
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 19, 21, 57, 133, 399, 9,041, 27,123, 63,287, 171,779, 189,861, 515,337, 1,202,453, 3,607,35916 in total
Arithmetic
Previous number3,607,358
Next number3,607,360
Double7,214,718
Half1,803,679.5
Square13,013,038,954,881
Cube46,942,703,191,240,569,279
Square root1,899.304872842≈irrational, shown to 9 decimal places
Cube root153.366246348≈
Negation-3,607,359
Reciprocal2.77211112 × 10^-7≈
Representations
Decimal3,607,359
Binary110111000010110011111122 bits
Octal15605477
Hexadecimal370B3F
Base 3625BGF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seven thousand, three hundred and fifty-nine
Ordinalthree million, six hundred and seven thousand, three hundred and fifty-ninth
Scientific notation3.607359 × 10^6
Engineering notation3.607359 × 10^6
In other bases
Ternary20210021100220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410413414base 5; one hand: 10 digits
Septenary42443040base 7: 8 digits
Nonary6707326base 9; each digit is two ternary digits: 7 digits
Duodecimal125b713base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ai7jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:42:2:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101T11010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110001111101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000101100111111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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
Bytes337 0b 3f
Gray code1011001000111010100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000101100111111
64-bit0000000000000000000000000000000000000000001101110000101100111111
One's complement11111111110010001111010011000000at 32 bits, every bit flipped
Bits reversed11111100110100001110110000000000at 32 bits
Rotated left by 100000000011011100001011001111110at 32 bits, wrapping
Shifted left by 111011100001011001111110= 7,214,718, no wrap
Shifted right by 1110111000010110011111= 1,803,679, discarding the low bit
These bits as a double1.78227215 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,607,359 to the power 213,013,038,954,881
3,607,359 to the power 346,942,703,191,240,569,279
3,607,359 to the power 4169,339,182,841,250,388,753,724,161
3,607,359 to the power 5610,867,225,275,030,161,124,245,635,700,799
First ten multiples3,607,359, 7,214,718, 10,822,077, 14,429,436, 18,036,795, 21,644,154, 25,251,513, 28,858,872, 32,466,231, 36,073,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached82,180,16822× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,607,359 → 10,822,078 → 5,411,039 → 16,233,118 → 8,116,559 → 24,349,678 → 12,174,839 → 36,524,518 → 18,262,259 → 54,786,778 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,735,900%
3,607,359% as a decimal36,073.59
3,607,359% of 1003,607,359
3,607,359% of 1,00036,073,590
As a fraction of 1003,607,359/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,607,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page