Recognised as Number

3,610,001

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,610,001

Digit count7

Digit sum11

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 212,353

Distinct prime factors217, 212,353

Number of divisors4

Sum of divisors σ(n)3,822,372

Aliquot sum212,371sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)212,352the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,397,632

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

SquarefreeYesno repeated prime factor

All divisors1, 17, 212,353, 3,610,0014 in total

Arithmetic

Previous number3,610,000

Next number3,610,002

Double7,220,002

Half1,805,000.5

Square13,032,107,220,001

Cube47,045,920,096,310,830,001

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

Cube root153.403678603≈

Negation-3,610,001

Reciprocal2.77008234 × 10^-7≈

Representations

Decimal3,610,001

Binary110111000101011001000122 bits

Octal15612621

Hexadecimal371591

Base 3625DHT

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

In wordsthree million, six hundred and ten thousand and one

Ordinalthree million, six hundred and ten thousand and first

Scientific notation3.610001 × 10^6

Engineering notation3.610001 × 10^6

In other bases

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

Quinary1411010001base 5; one hand: 10 digits

Septenary42453533base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001101110001010110010001

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 15 91

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

At each machine width

32-bit00000000001101110001010110010001

64-bit0000000000000000000000000000000000000000001101110001010110010001

One's complement11111111110010001110101001101110at 32 bits, every bit flipped

Bits reversed10001001101010001110110000000000at 32 bits

Rotated left by 100000000011011100010101100100010at 32 bits, wrapping

Shifted left by 111011100010101100100010= 7,220,002, no wrap

Shifted right by 1110111000101011001000= 1,805,000, discarding the low bit

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

Nearest landmarks

Next prime3,610,003+2

Previous prime3,609,997−4

Distance to nearest prime2

Nearest square below3,610,000

Nearest square above3,613,801

Powers & multiples

3,610,001 to the power 213,032,107,220,001

3,610,001 to the power 347,045,920,096,310,830,001

3,610,001 to the power 4169,835,818,593,602,192,614,440,001

3,610,001 to the power 5613,107,474,958,722,508,940,321,018,050,001

First ten multiples3,610,001, 7,220,002, 10,830,003, 14,440,004, 18,050,005, 21,660,006, 25,270,007, 28,880,008, 32,490,009, 36,100,010

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time

Highest value reached10,830,0043× the starting value

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

First steps3,610,001 → 10,830,004 → 5,415,002 → 2,707,501 → 8,122,504 → 4,061,252 → 2,030,626 → 1,015,313 → 3,045,940 → 1,522,970 → …

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

As a percentage & fraction

As a percentage361,000,100%

3,610,001% as a decimal36,100.01

3,610,001% of 1003,610,001

3,610,001% of 1,00036,100,010

As a fraction of 1003,610,001/100

Read another way

As seconds41 days, 18 hours and 46 minutes

As bytes3.443 MiB

As a 24-bit colour#371591

Keep nerding

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