Recognised as Number
3,277,697
- Positive
- Odd
- Prime
- 7 digits
3,277,697 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,277,697
Digit count7
Digit sum41
Digit product111,132
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,277,697
Distinct prime factors13,277,697
Number of divisors2
Sum of divisors σ(n)3,277,698
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,277,696integers below n that share no factor with it
Carmichael function λ(n)3,277,696the 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,277,6972 in total
Arithmetic
Previous number3,277,696
Next number3,277,698
Double6,555,394
Half1,638,848.5
Square10,743,297,623,809
Cube35,213,274,391,665,887,873
Square root1,810.441106471≈irrational, shown to 9 decimal places
Cube root148.544394516≈
Negation-3,277,697
Reciprocal3.05092264 × 10^-7≈
Representations
Decimal3,277,697
Binary110010000000111000000122 bits
Octal14401601
Hexadecimal320381
Base 361Y935
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and seventy-seven thousand, six hundred and ninety-seven
Ordinalthree million, two hundred and seventy-seven thousand, six hundred and ninety-seventh
Scientific notation3.277697 × 10^6
Engineering notation3.277697 × 10^6
In other bases
Ternary20011112011012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1314341242base 5; one hand: 10 digits
Septenary36600653base 7: 8 digits
Nonary6145135base 9; each digit is two ternary digits: 7 digits
Duodecimal1120995base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal109e4hbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:10:28:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TTTTT0111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100000010010000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100000001110000001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes332 03 81
Gray code1010110000001001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100000001110000001
64-bit0000000000000000000000000000000000000000001100100000001110000001
One's complement11111111110011011111110001111110at 32 bits, every bit flipped
Bits reversed10000001110000000100110000000000at 32 bits
Rotated left by 100000000011001000000011100000010at 32 bits, wrapping
Shifted left by 111001000000011100000010= 6,555,394, no wrap
Shifted right by 1110010000000111000000= 1,638,848, discarding the low bit
These bits as a double1.61939749 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,277,697 to the power 210,743,297,623,809
3,277,697 to the power 335,213,274,391,665,887,873
3,277,697 to the power 4115,418,443,833,740,105,683,668,481
3,277,697 to the power 5378,306,687,098,518,443,179,043,129,168,257
First ten multiples3,277,697, 6,555,394, 9,833,091, 13,110,788, 16,388,485, 19,666,182, 22,943,879, 26,221,576, 29,499,273, 32,776,970
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached9,833,0923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,277,697 → 9,833,092 → 4,916,546 → 2,458,273 → 7,374,820 → 3,687,410 → 1,843,705 → 5,531,116 → 2,765,558 → 1,382,779 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage327,769,700%
3,277,697% as a decimal32,776.97
3,277,697% of 1003,277,697
3,277,697% of 1,00032,776,970
As a fraction of 1003,277,697/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,277,697
Nerdulate something else
Nothing in mind? Surprise me · today’s page