Recognised as Number
3,605,641
- Positive
- Odd
- Composite
- 7 digits
3,605,641 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,605,641
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation13 × 23 × 31 × 389
Distinct prime factors413, 23, 31, 389
Number of divisors16
Sum of divisors σ(n)4,193,280
Aliquot sum587,639sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,072,960integers below n that share no factor with it
Carmichael function λ(n)64,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,072,960
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 23, 31, 299, 389, 403, 713, 5,057, 8,947, 9,269, 12,059, 116,311, 156,767, 277,357, 3,605,64116 in total
Arithmetic
Previous number3,605,640
Next number3,605,642
Double7,211,282
Half1,802,820.5
Square13,000,647,020,881
Cube46,875,665,925,016,389,721
Square root1,898.852548251≈irrational, shown to 9 decimal places
Cube root153.341895657≈
Negation-3,605,641
Reciprocal2.77343196 × 10^-7≈
Representations
Decimal3,605,641
Binary110111000001001000100122 bits
Octal15602211
Hexadecimal370489
Base 3625A4P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and five thousand, six hundred and forty-one
Ordinalthree million, six hundred and five thousand, six hundred and forty-first
Scientific notation3.605641 × 10^6
Engineering notation3.605641 × 10^6
In other bases
Ternary20210012000021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410340031base 5; one hand: 10 digits
Septenary42435034base 7: 8 digits
Nonary6705007base 9; each digit is two ternary digits: 7 digits
Duodecimal125a721base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ae21base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:34:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101TT0001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000010110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000010010001001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes337 04 89
Gray code1011001000011011001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000010010001001
64-bit0000000000000000000000000000000000000000001101110000010010001001
One's complement11111111110010001111101101110110at 32 bits, every bit flipped
Bits reversed10010001001000001110110000000000at 32 bits
Rotated left by 100000000011011100000100100010010at 32 bits, wrapping
Shifted left by 111011100000100100010010= 7,211,282, no wrap
Shifted right by 1110111000001001000100= 1,802,820, discarding the low bit
These bits as a double1.78142335 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,605,641 to the power 213,000,647,020,881
3,605,641 to the power 346,875,665,925,016,389,721
3,605,641 to the power 4169,016,822,961,542,020,450,016,161
3,605,641 to the power 5609,413,986,559,877,332,157,416,720,764,201
First ten multiples3,605,641, 7,211,282, 10,816,923, 14,422,564, 18,028,205, 21,633,846, 25,239,487, 28,845,128, 32,450,769, 36,056,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached187,338,90451× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,605,641 → 10,816,924 → 5,408,462 → 2,704,231 → 8,112,694 → 4,056,347 → 12,169,042 → 6,084,521 → 18,253,564 → 9,126,782 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,564,100%
3,605,641% as a decimal36,056.41
3,605,641% of 1003,605,641
3,605,641% of 1,00036,056,410
As a fraction of 1003,605,641/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,605,641
Nerdulate something else
Nothing in mind? Surprise me · today’s page