Nerdulator> put something in

Recognised as Number

3,013,939

  • Positive
  • Odd
  • Composite
  • 7 digits

3,013,939 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,013,939
Digit count7
Digit sum28
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation421 × 7,159
Distinct prime factors2421, 7,159
Number of divisors4
Sum of divisors σ(n)3,021,520
Aliquot sum7,581sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,006,360integers below n that share no factor with it
Carmichael function λ(n)501,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,006,360
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 421, 7,159, 3,013,9394 in total

Arithmetic

Previous number3,013,938
Next number3,013,940
Double6,027,878
Cube27,378,104,369,777,055,019
Square root1,736.069987068≈irrational, shown to 9 decimal places
Cube root144.447984375≈
Negation-3,013,939
Reciprocal3.31791718 × 10^-7≈

Representations

Decimal3,013,939
Binary101101111111010011001122 bits
Octal13376463
Hexadecimal2DFD33
Base 361SLKJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, thirteen thousand, nine hundred and thirty-nine
Ordinalthree million, thirteen thousand, nine hundred and thirty-ninth
Scientific notation3.013939 × 10^6
Engineering notation3.013939 × 10^6

In other bases

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

Bit-level

00000000001011011111110100110011
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes32d fd 33
Gray code1110110000001110101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001011011111110100110011
64-bit0000000000000000000000000000000000000000001011011111110100110011
One's complement11111111110100100000001011001100at 32 bits, every bit flipped
Bits reversed11001100101111111011010000000000at 32 bits
Rotated left by 100000000010110111111101001100110at 32 bits, wrapping
Shifted left by 110110111111101001100110= 6,027,878, no wrap
Shifted right by 1101101111111010011001= 1,506,969, discarding the low bit
These bits as a double1.48908372 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,013,957+18
Previous prime3,013,919−20
Distance to nearest prime18
Nearest square below3,013,696
Nearest square above3,017,169

Powers & multiples

3,013,939 to the power 29,083,828,295,721
3,013,939 to the power 327,378,104,369,777,055,019
3,013,939 to the power 482,515,936,506,141,487,426,909,841
3,013,939 to the power 5248,697,999,157,383,568,473,973,219,273,699
First ten multiples3,013,939, 6,027,878, 9,041,817, 12,055,756, 15,069,695, 18,083,634, 21,097,573, 24,111,512, 27,125,451, 30,139,390
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 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1257the total stopping time
Highest value reached13,562,7284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,013,939 → 9,041,818 → 4,520,909 → 13,562,728 → 6,781,364 → 3,390,682 → 1,695,341 → 5,086,024 → 2,543,012 → 1,271,506 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage301,393,900%
3,013,939% as a decimal30,139.39
3,013,939% of 1003,013,939
3,013,939% of 1,00030,139,390
As a fraction of 1003,013,939/100

Read another way

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

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 “3013939” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.