Recognised as Number
3,380,773
- Positive
- Odd
- Composite
- 7 digits
3,380,773 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,380,773
Digit count7
Digit sum31
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 factorisation11 × 17 × 101 × 179
Distinct prime factors411, 17, 101, 179
Number of divisors16
Sum of divisors σ(n)3,965,760
Aliquot sum584,987sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,848,000integers below n that share no factor with it
Carmichael function λ(n)35,600the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,848,000
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 17, 101, 179, 187, 1,111, 1,717, 1,969, 3,043, 18,079, 18,887, 33,473, 198,869, 307,343, 3,380,77316 in total
Arithmetic
Previous number3,380,772
Next number3,380,774
Double6,761,546
Half1,690,386.5
Square11,429,626,077,529
Cube38,640,971,243,005,949,917
Square root1,838.687847352≈irrational, shown to 9 decimal places
Cube root150.085477208≈
Negation-3,380,773
Reciprocal2.95790341 × 10^-7≈
Representations
Decimal3,380,773
Binary110011100101100010010122 bits
Octal14713045
Hexadecimal339625
Base 3620GMD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty thousand, seven hundred and seventy-three
Ordinalthree million, three hundred and eighty thousand, seven hundred and seventy-third
Scientific notation3.380773 × 10^6
Engineering notation3.380773 × 10^6
In other bases
Ternary20100202112211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331141043base 5; one hand: 10 digits
Septenary40510324base 7: 8 digits
Nonary6322484base 9; each digit is two ternary digits: 7 digits
Duodecimal1170571base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112bidbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:6:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T10TT0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110101001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001011000100101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes333 96 25
Gray code1010100101110100110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001011000100101
64-bit0000000000000000000000000000000000000000001100111001011000100101
One's complement11111111110011000110100111011010at 32 bits, every bit flipped
Bits reversed10100100011010011100110000000000at 32 bits
Rotated left by 100000000011001110010110001001010at 32 bits, wrapping
Shifted left by 111001110010110001001010= 6,761,546, no wrap
Shifted right by 1110011100101100010010= 1,690,386, discarding the low bit
These bits as a double1.6703238 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,380,773 to the power 211,429,626,077,529
3,380,773 to the power 338,640,971,243,005,949,917
3,380,773 to the power 4130,636,352,272,130,954,318,745,841
3,380,773 to the power 5441,651,852,580,108,982,825,049,333,115,093
First ten multiples3,380,773, 6,761,546, 10,142,319, 13,523,092, 16,903,865, 20,284,638, 23,665,411, 27,046,184, 30,426,957, 33,807,730
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 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached10,142,3203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,380,773 → 10,142,320 → 5,071,160 → 2,535,580 → 1,267,790 → 633,895 → 1,901,686 → 950,843 → 2,852,530 → 1,426,265 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,077,300%
3,380,773% as a decimal33,807.73
3,380,773% of 1003,380,773
3,380,773% of 1,00033,807,730
As a fraction of 1003,380,773/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,380,773
Nerdulate something else
Nothing in mind? Surprise me · today’s page