Recognised as Number
3,383,871
- Positive
- Odd
- Composite
- 7 digits
3,383,871 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,383,871
Digit count7
Digit sum33
Digit product12,096
Multiplicative persistence2times 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 × 1,127,957
Distinct prime factors23, 1,127,957
Number of divisors4
Sum of divisors σ(n)4,511,832
Aliquot sum1,127,961sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,255,912integers below n that share no factor with it
Carmichael function λ(n)1,127,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,255,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,127,957, 3,383,8714 in total
Arithmetic
Previous number3,383,870
Next number3,383,872
Double6,767,742
Half1,691,935.5
Square11,450,582,944,641
Cube38,747,295,559,465,285,311
Square root1,839.530103043≈irrational, shown to 9 decimal places
Cube root150.131307245≈
Negation-3,383,871
Reciprocal2.9551954 × 10^-7≈
Representations
Decimal3,383,871
Binary110011101000100011111122 bits
Octal14721077
Hexadecimal33A23F
Base 3620J0F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-three thousand, eight hundred and seventy-one
Ordinalthree million, three hundred and eighty-three thousand, eight hundred and seventy-first
Scientific notation3.383871 × 10^6
Engineering notation3.383871 × 10^6
In other bases
Ternary20100220210120base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331240441base 5; one hand: 10 digits
Septenary40522341base 7: 8 digits
Nonary6326716base 9; each digit is two ternary digits: 7 digits
Duodecimal1172313base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112jdbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:57:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01010T1T11TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110011001000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111010001000111111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 a2 3f
Gray code1010100111001100100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111010001000111111
64-bit0000000000000000000000000000000000000000001100111010001000111111
One's complement11111111110011000101110111000000at 32 bits, every bit flipped
Bits reversed11111100010001011100110000000000at 32 bits
Rotated left by 100000000011001110100010001111110at 32 bits, wrapping
Shifted left by 111001110100010001111110= 6,767,742, no wrap
Shifted right by 1110011101000100011111= 1,691,935, discarding the low bit
These bits as a double1.67185441 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,383,871 to the power 211,450,582,944,641
3,383,871 to the power 338,747,295,559,465,285,311
3,383,871 to the power 4131,115,849,772,103,354,470,618,881
3,383,871 to the power 5443,679,121,684,177,150,195,847,583,468,351
First ten multiples3,383,871, 6,767,742, 10,151,613, 13,535,484, 16,919,355, 20,303,226, 23,687,097, 27,070,968, 30,454,839, 33,838,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached77,088,83222× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,383,871 → 10,151,614 → 5,075,807 → 15,227,422 → 7,613,711 → 22,841,134 → 11,420,567 → 34,261,702 → 17,130,851 → 51,392,554 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,387,100%
3,383,871% as a decimal33,838.71
3,383,871% of 1003,383,871
3,383,871% of 1,00033,838,710
As a fraction of 1003,383,871/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,383,871
Nerdulate something else
Nothing in mind? Surprise me · today’s page