Recognised as Number
3,329,201
- Positive
- Odd
- Prime
- 7 digits
3,329,201 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,329,201
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,329,201
Distinct prime factors13,329,201
Number of divisors2
Sum of divisors σ(n)3,329,202
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,329,200integers below n that share no factor with it
Carmichael function λ(n)3,329,200the 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,329,2012 in total
Arithmetic
Previous number3,329,200
Next number3,329,202
Double6,658,402
Half1,664,600.5
Square11,083,579,298,401
Cube36,899,463,283,815,907,601
Square root1,824.609821304≈irrational, shown to 9 decimal places
Cube root149.318403832≈
Negation-3,329,201
Reciprocal3.00372372 × 10^-7≈
Representations
Decimal3,329,201
Binary110010110011001011000122 bits
Octal14546261
Hexadecimal32CCB1
Base 361ZCTT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-nine thousand, two hundred and one
Ordinalthree million, three hundred and twenty-nine thousand, two hundred and first
Scientific notation3.329201 × 10^6
Engineering notation3.329201 × 10^6
In other bases
Ternary20021010210202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323013301base 5; one hand: 10 digits
Septenary40204061base 7: 8 digits
Nonary6233722base 9; each digit is two ternary digits: 7 digits
Duodecimal1146755base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g301base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:24:46:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1011T11T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111101110111110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101100110010110001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 cc b1
Gray code1010111010101011101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101100110010110001
64-bit0000000000000000000000000000000000000000001100101100110010110001
One's complement11111111110011010011001101001110at 32 bits, every bit flipped
Bits reversed10001101001100110100110000000000at 32 bits
Rotated left by 100000000011001011001100101100010at 32 bits, wrapping
Shifted left by 111001011001100101100010= 6,658,402, no wrap
Shifted right by 1110010110011001011000= 1,664,600, discarding the low bit
These bits as a double1.64484384 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,329,201 to the power 211,083,579,298,401
3,329,201 to the power 336,899,463,283,815,907,601
3,329,201 to the power 4122,845,730,063,943,203,401,156,801
3,329,201 to the power 5408,978,127,374,609,776,706,334,623,046,001
First ten multiples3,329,201, 6,658,402, 9,987,603, 13,316,804, 16,646,005, 19,975,206, 23,304,407, 26,633,608, 29,962,809, 33,292,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1208the total stopping time
Highest value reached9,987,6043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,329,201 → 9,987,604 → 4,993,802 → 2,496,901 → 7,490,704 → 3,745,352 → 1,872,676 → 936,338 → 468,169 → 1,404,508 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,920,100%
3,329,201% as a decimal33,292.01
3,329,201% of 1003,329,201
3,329,201% of 1,00033,292,010
As a fraction of 1003,329,201/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,329,201
Nerdulate something else
Nothing in mind? Surprise me · today’s page