Recognised as Number

3,015,013

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,015,013

Digit count7

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,021 × 2,953

Distinct prime factors21,021, 2,953

Number of divisors4

Sum of divisors σ(n)3,018,988

Aliquot sum3,975sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)250,920the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,011,040

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

SquarefreeYesno repeated prime factor

All divisors1, 1,021, 2,953, 3,015,0134 in total

Arithmetic

Previous number3,015,012

Next number3,015,014

Double6,030,026

Half1,507,506.5

Square9,090,303,390,169

Cube27,407,382,895,303,607,197

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

Cube root144.465140076≈

Negation-3,015,013

Reciprocal3.31673528 × 10^-7≈

Representations

Decimal3,015,013

Binary101110000000010110010122 bits

Octal13400545

Hexadecimal2E0165

Base 361SMED

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

In wordsthree million, fifteen thousand and thirteen

Ordinalthree million, fifteen thousand and thirteenth

Scientific notation3.015013 × 10^6

Engineering notation3.015013 × 10^6

In other bases

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

Quinary1232440023base 5; one hand: 10 digits

Septenary34425061base 7: 8 digits

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

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

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

Sexagesimal13:57:30:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001011100000000101100101

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

Bytes32e 01 65

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

At each machine width

32-bit00000000001011100000000101100101

64-bit0000000000000000000000000000000000000000001011100000000101100101

One's complement11111111110100011111111010011010at 32 bits, every bit flipped

Bits reversed10100110100000000111010000000000at 32 bits

Rotated left by 100000000010111000000001011001010at 32 bits, wrapping

Shifted left by 110111000000001011001010= 6,030,026, no wrap

Shifted right by 1101110000000010110010= 1,507,506, discarding the low bit

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

Nearest landmarks

Next prime3,015,037+24

Previous prime3,015,007−6

Distance to nearest prime6

Nearest square below3,013,696

Nearest square above3,017,169

Powers & multiples

3,015,013 to the power 29,090,303,390,169

3,015,013 to the power 327,407,382,895,303,607,197

3,015,013 to the power 482,633,615,725,318,014,645,848,561

3,015,013 to the power 5249,141,425,648,838,243,291,423,807,446,293

First ten multiples3,015,013, 6,030,026, 9,045,039, 12,060,052, 15,075,065, 18,090,078, 21,105,091, 24,120,104, 27,135,117, 30,150,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1182the total stopping time

Highest value reached9,045,0403× the starting value

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

First steps3,015,013 → 9,045,040 → 4,522,520 → 2,261,260 → 1,130,630 → 565,315 → 1,695,946 → 847,973 → 2,543,920 → 1,271,960 → …

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

As a percentage & fraction

As a percentage301,501,300%

3,015,013% as a decimal30,150.13

3,015,013% of 1003,015,013

3,015,013% of 1,00030,150,130

As a fraction of 1003,015,013/100

Read another way

As seconds34 days, 21 hours and 30 minutes

As bytes2.875 MiB

As a 24-bit colour#2E0165

Keep nerding

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