Nerdulator> put something in

Recognised as Number

3,014,066

  • Positive
  • Even
  • Composite
  • 7 digits

3,014,066 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,014,066
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 factorisation2 × 11 × 17 × 8,059
Distinct prime factors42, 11, 17, 8,059
Number of divisors16
Sum of divisors σ(n)5,222,880
Aliquot sum2,208,814sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,289,280integers below n that share no factor with it
Carmichael function λ(n)322,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,289,280
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 11, 17, 22, 34, 187, 374, 8,059, 16,118, 88,649, 137,003, 177,298, 274,006, 1,507,033, 3,014,06616 in total

Arithmetic

Previous number3,014,065
Next number3,014,067
Double6,028,132
Cube27,381,565,454,195,239,496
Square root1,736.10656355≈irrational, shown to 9 decimal places
Cube root144.450013241≈
Negation-3,014,066
Reciprocal3.31777738 × 10^-7≈

Representations

Decimal3,014,066
Binary101101111111011011001022 bits
Octal13376662
Hexadecimal2DFDB2
Base 361SLO2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, fourteen thousand and sixty-six
Ordinalthree million, fourteen thousand and sixty-sixth
Scientific notation3.014066 × 10^6
Engineering notation3.014066 × 10^6

In other bases

Ternary12200010112002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1232422231base 5; one hand: 10 digits
Septenary34422236base 7: 8 digits
Nonary5603462base 9; each digit is two ternary digits: 7 digits
Duodecimal1014302base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaligf36base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:57:14:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00011TTT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100000001011110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001011011111110110110010
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes32d fd b2
Gray code1110110000001101101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001011011111110110110010
64-bit0000000000000000000000000000000000000000001011011111110110110010
One's complement11111111110100100000001001001101at 32 bits, every bit flipped
Bits reversed01001101101111111011010000000000at 32 bits
Rotated left by 100000000010110111111101101100100at 32 bits, wrapping
Shifted left by 110110111111101101100100= 6,028,132, no wrap
Shifted right by 1101101111111011011001= 1,507,033, discarding the low bit
These bits as a double1.48914646 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,014,093+27
Previous prime3,014,059−7
Distance to nearest prime7
Nearest square below3,013,696
Nearest square above3,017,169

Powers & multiples

3,014,066 to the power 29,084,593,852,356
3,014,066 to the power 327,381,565,454,195,239,496
3,014,066 to the power 482,529,845,462,264,428,726,750,736
3,014,066 to the power 5248,750,401,193,065,497,634,722,683,852,576
First ten multiples3,014,066, 6,028,132, 9,042,198, 12,056,264, 15,070,330, 18,084,396, 21,098,462, 24,112,528, 27,126,594, 30,140,660
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 1138the total stopping time
Highest value reached5,086,2401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,014,066 → 1,507,033 → 4,521,100 → 2,260,550 → 1,130,275 → 3,390,826 → 1,695,413 → 5,086,240 → 2,543,120 → 1,271,560 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage301,406,600%
3,014,066% as a decimal30,140.66
3,014,066% of 1003,014,066
3,014,066% of 1,00030,140,660
As a fraction of 1003,014,066/100

Read another way

As bytes2.874 MiB
As a 24-bit colour#2DFDB2

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3014066” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.