Recognised as Number

3,610,135

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,610,135

Digit count7

Digit sum19

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 722,027

Distinct prime factors25, 722,027

Number of divisors4

Sum of divisors σ(n)4,332,168

Aliquot sum722,033sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,888,104integers below n that share no factor with it

Carmichael function λ(n)1,444,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,888,104

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 722,027, 3,610,1354 in total

Arithmetic

Previous number3,610,134

Next number3,610,136

Double7,220,270

Half1,805,067.5

Square13,033,074,718,225

Cube47,051,159,197,879,210,375

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

Cube root153.405576648≈

Negation-3,610,135

Reciprocal2.76997952 × 10^-7≈

Representations

Decimal3,610,135

Binary110111000101100001011122 bits

Octal15613027

Hexadecimal371617

Base 3625DLJ

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

In wordsthree million, six hundred and ten thousand, one hundred and thirty-five

Ordinalthree million, six hundred and ten thousand, one hundred and thirty-fifth

Scientific notation3.610135 × 10^6

Engineering notation3.610135 × 10^6

In other bases

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

Quinary1411011020base 5; one hand: 10 digits

Septenary42454114base 7: 8 digits

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

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

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

Sexagesimal16:42:48:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001101110001011000010111

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

Bit parityeven12 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 16 17

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

At each machine width

32-bit00000000001101110001011000010111

64-bit0000000000000000000000000000000000000000001101110001011000010111

One's complement11111111110010001110100111101000at 32 bits, every bit flipped

Bits reversed11101000011010001110110000000000at 32 bits

Rotated left by 100000000011011100010110000101110at 32 bits, wrapping

Shifted left by 111011100010110000101110= 7,220,270, no wrap

Shifted right by 1110111000101100001011= 1,805,067, discarding the low bit

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

Nearest landmarks

Next prime3,610,153+18

Previous prime3,610,129−6

Distance to nearest prime6

Nearest square below3,610,000

Nearest square above3,613,801

Powers & multiples

3,610,135 to the power 213,033,074,718,225

3,610,135 to the power 347,051,159,197,879,210,375

3,610,135 to the power 4169,861,036,610,835,663,147,150,625

3,610,135 to the power 5613,221,273,405,059,206,775,738,621,584,375

First ten multiples3,610,135, 7,220,270, 10,830,405, 14,440,540, 18,050,675, 21,660,810, 25,270,945, 28,881,080, 32,491,215, 36,101,350

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1115the total stopping time

Highest value reached32,934,5809× the starting value

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

First steps3,610,135 → 10,830,406 → 5,415,203 → 16,245,610 → 8,122,805 → 24,368,416 → 12,184,208 → 6,092,104 → 3,046,052 → 1,523,026 → …

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

As a percentage & fraction

As a percentage361,013,500%

3,610,135% as a decimal36,101.35

3,610,135% of 1003,610,135

3,610,135% of 1,00036,101,350

As a fraction of 1003,610,135/100

Read another way

As seconds41 days, 18 hours and 48 minutes

As bytes3.443 MiB

As a 24-bit colour#371617

Keep nerding

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