Recognised as Number
3,605,301
- Positive
- Odd
- Composite
- 7 digits
3,605,301 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,605,301
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 7 × 89 × 643
Distinct prime factors43, 7, 89, 643
Number of divisors24
Sum of divisors σ(n)6,027,840
Aliquot sum2,422,539sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,033,856integers below n that share no factor with it
Carmichael function λ(n)28,248the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,033,856
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 89, 267, 623, 643, 801, 1,869, 1,929, 4,501, 5,607, 5,787, 13,503, 40,509, 57,227, 171,681, 400,589, 515,043, 1,201,767, 3,605,30124 in total
Arithmetic
Previous number3,605,300
Next number3,605,302
Double7,210,602
Half1,802,650.5
Square12,998,195,300,601
Cube46,862,406,515,452,085,901
Square root1,898.763018389≈irrational, shown to 9 decimal places
Cube root153.337075628≈
Negation-3,605,301
Reciprocal2.77369351 × 10^-7≈
Representations
Decimal3,605,301
Binary110111000000110011010122 bits
Octal15601465
Hexadecimal370335
Base 36259V9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and five thousand, three hundred and one
Ordinalthree million, six hundred and five thousand, three hundred and first
Scientific notation3.605301 × 10^6
Engineering notation3.605301 × 10^6
In other bases
Ternary20210011112200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410332201base 5; one hand: 10 digits
Septenary42434040base 7: 8 digits
Nonary6704480base 9; each digit is two ternary digits: 7 digits
Duodecimal125a499base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ad51base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:28:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T101TTTT0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000011101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110000001100110101
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 03 35
Gray code1011001000001010101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110000001100110101
64-bit0000000000000000000000000000000000000000001101110000001100110101
One's complement11111111110010001111110011001010at 32 bits, every bit flipped
Bits reversed10101100110000001110110000000000at 32 bits
Rotated left by 100000000011011100000011001101010at 32 bits, wrapping
Shifted left by 111011100000011001101010= 7,210,602, no wrap
Shifted right by 1110111000000110011010= 1,802,650, discarding the low bit
These bits as a double1.78125537 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,605,301 to the power 212,998,195,300,601
3,605,301 to the power 346,862,406,515,452,085,901
3,605,301 to the power 4168,953,081,072,565,920,750,961,201
3,605,301 to the power 5609,126,712,144,002,986,649,361,168,926,501
First ten multiples3,605,301, 7,210,602, 10,815,903, 14,421,204, 18,026,505, 21,631,806, 25,237,107, 28,842,408, 32,447,709, 36,053,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 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1296the total stopping time
Highest value reached10,815,9043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,605,301 → 10,815,904 → 5,407,952 → 2,703,976 → 1,351,988 → 675,994 → 337,997 → 1,013,992 → 506,996 → 253,498 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,530,100%
3,605,301% as a decimal36,053.01
3,605,301% of 1003,605,301
3,605,301% of 1,00036,053,010
As a fraction of 1003,605,301/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,301
Nerdulate something else
Nothing in mind? Surprise me · today’s page