Recognised as Number
3,617,601
- Positive
- Odd
- Composite
- 7 digits
3,617,601 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,617,601
Digit count7
Digit sum24
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 × 13 × 23 × 37 × 109
Distinct prime factors53, 13, 23, 37, 109
Number of divisors32
Sum of divisors σ(n)5,617,920
Aliquot sum2,000,319sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,052,864integers below n that share no factor with it
Carmichael function λ(n)1,188the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,052,864
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 23, 37, 39, 69, 109, 111, 299, 327, 481, 851, 897, 1,417, 1,443, 2,507, 2,553, 4,033, 4,251, 7,521, 11,063, 12,099, 32,591, 33,189, 52,429, 92,759, 97,773, 157,287, 278,277, 1,205,867, 3,617,60132 in total
Arithmetic
Previous number3,617,600
Next number3,617,602
Double7,235,202
Half1,808,800.5
Square13,087,036,995,201
Cube47,343,678,120,876,132,801
Square root1,901.999211356≈irrational, shown to 9 decimal places
Cube root153.51125482≈
Negation-3,617,601
Reciprocal2.76426284 × 10^-7≈
Representations
Decimal3,617,601
Binary110111001100110100000122 bits
Octal15631501
Hexadecimal373341
Base 3625JCX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and seventeen thousand, six hundred and one
Ordinalthree million, six hundred and seventeen thousand, six hundred and first
Scientific notation3.617601 × 10^6
Engineering notation3.617601 × 10^6
In other bases
Ternary20210210102020base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411230401base 5; one hand: 10 digits
Septenary42514641base 7: 8 digits
Nonary6723366base 9; each digit is two ternary digits: 7 digits
Duodecimal1265629base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12c401base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:44:53:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T11T1011T1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110111011101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110011001101000001
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
Bytes337 33 41
Gray code1011001010101011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110011001101000001
64-bit0000000000000000000000000000000000000000001101110011001101000001
One's complement11111111110010001100110010111110at 32 bits, every bit flipped
Bits reversed10000010110011001110110000000000at 32 bits
Rotated left by 100000000011011100110011010000010at 32 bits, wrapping
Shifted left by 111011100110011010000010= 7,235,202, no wrap
Shifted right by 1110111001100110100000= 1,808,800, discarding the low bit
These bits as a double1.78733237 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,617,601 to the power 213,087,036,995,201
3,617,601 to the power 347,343,678,120,876,132,801
3,617,601 to the power 4171,270,537,313,759,618,897,030,401
3,617,601 to the power 5619,588,467,056,794,111,081,516,075,688,001
First ten multiples3,617,601, 7,235,202, 10,852,803, 14,470,404, 18,088,005, 21,705,606, 25,323,207, 28,940,808, 32,558,409, 36,176,010
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 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 166the total stopping time
Highest value reached10,852,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,617,601 → 10,852,804 → 5,426,402 → 2,713,201 → 8,139,604 → 4,069,802 → 2,034,901 → 6,104,704 → 3,052,352 → 1,526,176 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage361,760,100%
3,617,601% as a decimal36,176.01
3,617,601% of 1003,617,601
3,617,601% of 1,00036,176,010
As a fraction of 1003,617,601/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,617,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page