Nerdulator> put something in

Recognised as Number

3,377,049

  • Positive
  • Odd
  • Composite
  • 7 digits

3,377,049 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,377,049
Digit count7
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 131 × 661
Distinct prime factors43, 13, 131, 661
Number of divisors16
Sum of divisors σ(n)4,893,504
Aliquot sum1,516,455sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,059,200integers below n that share no factor with it
Carmichael function λ(n)8,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,059,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 39, 131, 393, 661, 1,703, 1,983, 5,109, 8,593, 25,779, 86,591, 259,773, 1,125,683, 3,377,04916 in total

Arithmetic

Previous number3,377,048
Next number3,377,050
Double6,754,098
Cube38,513,420,064,287,648,649
Square root1,837.674889636≈irrational, shown to 9 decimal places
Cube root150.030349415≈
Negation-3,377,049
Reciprocal2.96116521 × 10^-7≈

Representations

Decimal3,377,049
Binary110011100001111001100122 bits
Octal14703631
Hexadecimal338799
Base 3620DQX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-seven thousand and forty-nine
Ordinalthree million, three hundred and seventy-seven thousand and forty-ninth
Scientific notation3.377049 × 10^6
Engineering notation3.377049 × 10^6

In other bases

Ternary20100120102220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331031144base 5; one hand: 10 digits
Septenary40463424base 7: 8 digits
Nonary6316386base 9; each digit is two ternary digits: 7 digits
Duodecimal116a389base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1122c9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:38:4:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101TT01100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001001100011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100111000011110011001
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
Bytes333 87 99
Gray code1010100100010001010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100111000011110011001
64-bit0000000000000000000000000000000000000000001100111000011110011001
One's complement11111111110011000111100001100110at 32 bits, every bit flipped
Bits reversed10011001111000011100110000000000at 32 bits
Rotated left by 100000000011001110000111100110010at 32 bits, wrapping
Shifted left by 111001110000111100110010= 6,754,098, no wrap
Shifted right by 1110011100001111001100= 1,688,524, discarding the low bit
These bits as a double1.6684839 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,377,051+2
Previous prime3,377,029−20
Distance to nearest prime2
Nearest square below3,374,569
Nearest square above3,378,244

Powers & multiples

3,377,049 to the power 211,404,459,948,401
3,377,049 to the power 338,513,420,064,287,648,649
3,377,049 to the power 4130,061,706,714,682,539,582,456,801
3,377,049 to the power 5439,224,756,599,111,955,614,396,157,360,249
First ten multiples3,377,049, 6,754,098, 10,131,147, 13,508,196, 16,885,245, 20,262,294, 23,639,343, 27,016,392, 30,393,441, 33,770,490
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time
Highest value reached11,397,5443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,377,049 → 10,131,148 → 5,065,574 → 2,532,787 → 7,598,362 → 3,799,181 → 11,397,544 → 5,698,772 → 2,849,386 → 1,424,693 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage337,704,900%
3,377,049% as a decimal33,770.49
3,377,049% of 1003,377,049
3,377,049% of 1,00033,770,490
As a fraction of 1003,377,049/100

Read another way

As bytes3.221 MiB
As a 24-bit colour#338799

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