Recognised as Number
3,288,361
- Positive
- Odd
- Composite
- 7 digits
3,288,361 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,288,361
Digit count7
Digit sum31
Digit product6,912
Multiplicative persistence3times 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 factorisation17 × 193,433
Distinct prime factors217, 193,433
Number of divisors4
Sum of divisors σ(n)3,481,812
Aliquot sum193,451sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,094,912integers below n that share no factor with it
Carmichael function λ(n)386,864the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,094,912
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 193,433, 3,288,3614 in total
Arithmetic
Previous number3,288,360
Next number3,288,362
Double6,576,722
Half1,644,180.5
Square10,813,318,066,321
Cube35,558,093,409,885,389,881
Square root1,813.383853463≈irrational, shown to 9 decimal places
Cube root148.705316711≈
Negation-3,288,361
Reciprocal3.04102865 × 10^-7≈
Representations
Decimal3,288,361
Binary110010001011010010100122 bits
Octal14426451
Hexadecimal322D29
Base 361YHBD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and eighty-eight thousand, three hundred and sixty-one
Ordinalthree million, two hundred and eighty-eight thousand, three hundred and sixty-first
Scientific notation3.288361 × 10^6
Engineering notation3.288361 × 10^6
In other bases
Ternary20012001210011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1320211421base 5; one hand: 10 digits
Septenary36644026base 7: 8 digits
Nonary6161704base 9; each digit is two ternary digits: 7 digits
Duodecimal1126ba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10b0i1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:13:26:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TT01TT10011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100111110101111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100010110100101001
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 2d 29
Gray code1010110011101110111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100010110100101001
64-bit0000000000000000000000000000000000000000001100100010110100101001
One's complement11111111110011011101001011010110at 32 bits, every bit flipped
Bits reversed10010100101101000100110000000000at 32 bits
Rotated left by 100000000011001000101101001010010at 32 bits, wrapping
Shifted left by 111001000101101001010010= 6,576,722, no wrap
Shifted right by 1110010001011010010100= 1,644,180, discarding the low bit
These bits as a double1.6246662 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,288,361 to the power 210,813,318,066,321
3,288,361 to the power 335,558,093,409,885,389,881
3,288,361 to the power 4116,927,847,603,424,130,554,475,041
3,288,361 to the power 5384,500,973,873,043,377,374,244,100,297,801
First ten multiples3,288,361, 6,576,722, 9,865,083, 13,153,444, 16,441,805, 19,730,166, 23,018,527, 26,306,888, 29,595,249, 32,883,610
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1195the total stopping time
Highest value reached47,405,89614× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,288,361 → 9,865,084 → 4,932,542 → 2,466,271 → 7,398,814 → 3,699,407 → 11,098,222 → 5,549,111 → 16,647,334 → 8,323,667 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage328,836,100%
3,288,361% as a decimal32,883.61
3,288,361% of 1003,288,361
3,288,361% of 1,00032,883,610
As a fraction of 1003,288,361/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,288,361
Nerdulate something else
Nothing in mind? Surprise me · today’s page