Recognised as Number

3,164,015

Positive
Odd
Composite
7 digits

3,164,015 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,164,015

Digit count7

Digit sum20

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 factorisation5 × 31 × 137 × 149

Distinct prime factors45, 31, 137, 149

Number of divisors16

Sum of divisors σ(n)3,974,400

Aliquot sum810,385sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)75,480the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,415,360

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 31, 137, 149, 155, 685, 745, 4,247, 4,619, 20,413, 21,235, 23,095, 102,065, 632,803, 3,164,01516 in total

Arithmetic

Previous number3,164,014

Next number3,164,016

Double6,328,030

Half1,582,007.5

Square10,010,990,920,225

Cube31,674,925,436,455,703,375

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

Cube root146.806801898≈

Negation-3,164,015

Reciprocal3.16054127 × 10^-7≈

Representations

Decimal3,164,015

Binary110000010001110110111122 bits

Octal14043557

Hexadecimal30476F

Base 361VTDB

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

In wordsthree million, one hundred and sixty-four thousand and fifteen

Ordinalthree million, one hundred and sixty-four thousand and fifteenth

Scientific notation3.164015 × 10^6

Engineering notation3.164015 × 10^6

In other bases

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

Quinary1302222030base 5; one hand: 10 digits

Septenary35615351base 7: 8 digits

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

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

Vigesimaljfa0fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal14:38:53:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001100000100011101101111

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

Bytes330 47 6f

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

At each machine width

32-bit00000000001100000100011101101111

64-bit0000000000000000000000000000000000000000001100000100011101101111

One's complement11111111110011111011100010010000at 32 bits, every bit flipped

Bits reversed11110110111000100000110000000000at 32 bits

Rotated left by 100000000011000001000111011011110at 32 bits, wrapping

Shifted left by 111000001000111011011110= 6,328,030, no wrap

Shifted right by 1110000010001110110111= 1,582,007, discarding the low bit

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

Nearest landmarks

Next prime3,164,053+38

Previous prime3,164,003−12

Distance to nearest prime12

Nearest square below3,161,284

Nearest square above3,164,841

Powers & multiples

3,164,015 to the power 210,010,990,920,225

3,164,015 to the power 331,674,925,436,455,703,375

3,164,015 to the power 4100,219,939,204,827,392,314,050,625

3,164,015 to the power 5317,097,390,943,161,941,692,540,888,259,375

First ten multiples3,164,015, 6,328,030, 9,492,045, 12,656,060, 15,820,075, 18,984,090, 22,148,105, 25,312,120, 28,476,135, 31,640,150

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 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 11

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1270the total stopping time

Highest value reached36,040,12011× the starting value

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

First steps3,164,015 → 9,492,046 → 4,746,023 → 14,238,070 → 7,119,035 → 21,357,106 → 10,678,553 → 32,035,660 → 16,017,830 → 8,008,915 → …

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

As a percentage & fraction

As a percentage316,401,500%

3,164,015% as a decimal31,640.15

3,164,015% of 1003,164,015

3,164,015% of 1,00031,640,150

As a fraction of 1003,164,015/100

Read another way

As seconds36 days, 14 hours and 53 minutes

As bytes3.017 MiB

As a 24-bit colour#30476F

Keep nerding

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