Recognised as Number
3,328,177
- Positive
- Odd
- Prime
- 7 digits
3,328,177 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,328,177
Digit count7
Digit sum31
Digit product7,056
Multiplicative persistence2times 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 factorisation3,328,177
Distinct prime factors13,328,177
Number of divisors2
Sum of divisors σ(n)3,328,178
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,328,176integers below n that share no factor with it
Carmichael function λ(n)3,328,176the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,328,1772 in total
Arithmetic
Previous number3,328,176
Next number3,328,178
Double6,656,354
Half1,664,088.5
Square11,076,762,143,329
Cube36,865,424,999,898,281,233
Square root1,824.329191785≈irrational, shown to 9 decimal places
Cube root149.303093079≈
Negation-3,328,177
Reciprocal3.00464789 × 10^-7≈
Representations
Decimal3,328,177
Binary110010110010001011000122 bits
Octal14544261
Hexadecimal32C8B1
Base 361ZC1D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-eight thousand, one hundred and seventy-seven
Ordinalthree million, three hundred and twenty-eight thousand, one hundred and seventy-seventh
Scientific notation3.328177 × 10^6
Engineering notation3.328177 × 10^6
In other bases
Ternary20021002101211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323000202base 5; one hand: 10 digits
Septenary40201066base 7: 8 digits
Nonary6232354base 9; each digit is two ternary digits: 7 digits
Duodecimal1146041base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g08hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:24:29:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T101T11TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111101100111110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101100100010110001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes332 c8 b1
Gray code1010111010110011101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101100100010110001
64-bit0000000000000000000000000000000000000000001100101100100010110001
One's complement11111111110011010011011101001110at 32 bits, every bit flipped
Bits reversed10001101000100110100110000000000at 32 bits
Rotated left by 100000000011001011001000101100010at 32 bits, wrapping
Shifted left by 111001011001000101100010= 6,656,354, no wrap
Shifted right by 1110010110010001011000= 1,664,088, discarding the low bit
These bits as a double1.64433792 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,328,177 to the power 211,076,762,143,329
3,328,177 to the power 336,865,424,999,898,281,233
3,328,177 to the power 4122,694,659,579,886,461,939,202,241
3,328,177 to the power 5408,349,544,036,607,785,237,428,296,844,657
First ten multiples3,328,177, 6,656,354, 9,984,531, 13,312,708, 16,640,885, 19,969,062, 23,297,239, 26,625,416, 29,953,593, 33,281,770
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached9,984,5323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,328,177 → 9,984,532 → 4,992,266 → 2,496,133 → 7,488,400 → 3,744,200 → 1,872,100 → 936,050 → 468,025 → 1,404,076 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,817,700%
3,328,177% as a decimal33,281.77
3,328,177% of 1003,328,177
3,328,177% of 1,00033,281,770
As a fraction of 1003,328,177/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,328,177
Nerdulate something else
Nothing in mind? Surprise me · today’s page