Recognised as Number
3,382,191
- Positive
- Odd
- Composite
- 7 digits
3,382,191 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,382,191
Digit count7
Digit sum27
Digit product1,296
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 375,799
Distinct prime factors23, 375,799
Number of divisors6
Sum of divisors σ(n)4,885,400
Aliquot sum1,503,209sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,254,788integers below n that share no factor with it
Carmichael function λ(n)375,798the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,254,788
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 375,799, 1,127,397, 3,382,1916 in total
Arithmetic
Previous number3,382,190
Next number3,382,192
Double6,764,382
Half1,691,095.5
Square11,439,215,960,481
Cube38,689,613,268,595,193,871
Square root1,839.073407997≈irrational, shown to 9 decimal places
Cube root150.10645776≈
Negation-3,382,191
Reciprocal2.9566633 × 10^-7≈
Representations
Decimal3,382,191
Binary110011100110111010111122 bits
Octal14715657
Hexadecimal339BAF
Base 3620HPR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-two thousand, one hundred and ninety-one
Ordinalthree million, three hundred and eighty-two thousand, one hundred and ninety-first
Scientific notation3.382191 × 10^6
Engineering notation3.382191 × 10^6
In other bases
Ternary20100211111100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331212231base 5; one hand: 10 digits
Septenary40514421base 7: 8 digits
Nonary6324440base 9; each digit is two ternary digits: 7 digits
Duodecimal1171353base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112f9bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:29:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T11111100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110110011110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001101110101111
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
Bytes333 9b af
Gray code1010100101011001111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001101110101111
64-bit0000000000000000000000000000000000000000001100111001101110101111
One's complement11111111110011000110010001010000at 32 bits, every bit flipped
Bits reversed11110101110110011100110000000000at 32 bits
Rotated left by 100000000011001110011011101011110at 32 bits, wrapping
Shifted left by 111001110011011101011110= 6,764,382, no wrap
Shifted right by 1110011100110111010111= 1,691,095, discarding the low bit
These bits as a double1.67102438 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,382,191 to the power 211,439,215,960,481
3,382,191 to the power 338,689,613,268,595,193,871
3,382,191 to the power 4130,855,661,790,523,247,353,751,361
3,382,191 to the power 5442,578,841,606,951,612,490,631,669,411,951
First ten multiples3,382,191, 6,764,382, 10,146,573, 13,528,764, 16,910,955, 20,293,146, 23,675,337, 27,057,528, 30,439,719, 33,821,910
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 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached34,244,69210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,382,191 → 10,146,574 → 5,073,287 → 15,219,862 → 7,609,931 → 22,829,794 → 11,414,897 → 34,244,692 → 17,122,346 → 8,561,173 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,219,100%
3,382,191% as a decimal33,821.91
3,382,191% of 1003,382,191
3,382,191% of 1,00033,821,910
As a fraction of 1003,382,191/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,382,191
Nerdulate something else
Nothing in mind? Surprise me · today’s page