Recognised as Number

3,605,011

Positive
Odd
Composite
7 digits

3,605,011 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,605,011

Digit count7

Digit sum16

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 factorisation821 × 4,391

Distinct prime factors2821, 4,391

Number of divisors4

Sum of divisors σ(n)3,610,224

Aliquot sum5,213sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,599,800integers below n that share no factor with it

Carmichael function λ(n)359,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,599,800

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 821, 4,391, 3,605,0114 in total

Arithmetic

Previous number3,605,010

Next number3,605,012

Double7,210,022

Half1,802,505.5

Square12,996,104,310,121

Cube46,851,098,995,133,616,331

Square root1,898.686651346≈irrational, shown to 9 decimal places

Cube root153.332964187≈

Negation-3,605,011

Reciprocal2.77391664 × 10^-7≈

Representations

Decimal3,605,011

Binary110111000000100001001122 bits

Octal15601023

Hexadecimal370213

Base 36259N7

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, six hundred and five thousand and eleven

Ordinalthree million, six hundred and five thousand and eleventh

Scientific notation3.605011 × 10^6

Engineering notation3.605011 × 10^6

In other bases

Ternary20210011010221base 3; the most digit-efficient integer base after e: 14 digits

Quinary1410330021base 5; one hand: 10 digits

Septenary42433144base 7: 8 digits

Nonary6704127base 9; each digit is two ternary digits: 7 digits

Duodecimal125a297base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal12acabbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal16:41:23:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T1T100110110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10010110000011000010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101110000001000010011

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 02 13

Gray code1011001000001100011010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101110000001000010011

64-bit0000000000000000000000000000000000000000001101110000001000010011

One's complement11111111110010001111110111101100at 32 bits, every bit flipped

Bits reversed11001000010000001110110000000000at 32 bits

Rotated left by 100000000011011100000010000100110at 32 bits, wrapping

Shifted left by 111011100000010000100110= 7,210,022, no wrap

Shifted right by 1110111000000100001001= 1,802,505, discarding the low bit

These bits as a double1.78111209 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,605,027+16

Previous prime3,604,999−12

Distance to nearest prime12

Nearest square below3,602,404

Nearest square above3,606,201

Powers & multiples

3,605,011 to the power 212,996,104,310,121

3,605,011 to the power 346,851,098,995,133,616,331

3,605,011 to the power 4168,898,727,239,545,633,343,034,641

3,605,011 to the power 5608,881,769,584,561,643,203,606,654,186,051

First ten multiples3,605,011, 7,210,022, 10,815,033, 14,420,044, 18,025,055, 21,630,066, 25,235,077, 28,840,088, 32,445,099, 36,050,110

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 3

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time

Highest value reached16,222,5524× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,605,011 → 10,815,034 → 5,407,517 → 16,222,552 → 8,111,276 → 4,055,638 → 2,027,819 → 6,083,458 → 3,041,729 → 9,125,188 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage360,501,100%

3,605,011% as a decimal36,050.11

3,605,011% of 1003,605,011

3,605,011% of 1,00036,050,110

As a fraction of 1003,605,011/100

Read another way

As seconds41 days, 17 hours and 23 minutes

As bytes3.438 MiB

As a 24-bit colour#370213

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.