Recognised as Number
3,242,009
- Positive
- Odd
- Prime
- 7 digits
3,242,009 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,242,009
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,242,009
Distinct prime factors13,242,009
Number of divisors2
Sum of divisors σ(n)3,242,010
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,242,008integers below n that share no factor with it
Carmichael function λ(n)3,242,008the 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,242,0092 in total
Arithmetic
Previous number3,242,008
Next number3,242,010
Double6,484,018
Half1,621,004.5
Square10,510,622,356,081
Cube34,075,532,274,015,806,729
Square root1,800.557969075≈irrational, shown to 9 decimal places
Cube root148.003302215≈
Negation-3,242,009
Reciprocal3.08450717 × 10^-7≈
Representations
Decimal3,242,009
Binary110001011110000001100122 bits
Octal14274031
Hexadecimal317819
Base 361XHJT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and forty-two thousand and nine
Ordinalthree million, two hundred and forty-two thousand and ninth
Scientific notation3.242009 × 10^6
Engineering notation3.242009 × 10^6
In other bases
Ternary20002201012102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1312221014base 5; one hand: 10 digits
Septenary36361631base 7: 8 digits
Nonary6081172base 9; each digit is two ternary digits: 7 digits
Duodecimal11041b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal105509base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:0:33:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T011TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101000100001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100010111100000011001
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
Bytes331 78 19
Gray code1010011100010000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100010111100000011001
64-bit0000000000000000000000000000000000000000001100010111100000011001
One's complement11111111110011101000011111100110at 32 bits, every bit flipped
Bits reversed10011000000111101000110000000000at 32 bits
Rotated left by 100000000011000101111000000110010at 32 bits, wrapping
Shifted left by 111000101111000000110010= 6,484,018, no wrap
Shifted right by 1110001011110000001100= 1,621,004, discarding the low bit
These bits as a double1.60176527 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,242,009 to the power 210,510,622,356,081
3,242,009 to the power 334,075,532,274,015,806,729
3,242,009 to the power 4110,473,182,312,149,711,557,678,561
3,242,009 to the power 5358,155,051,314,630,174,217,397,913,869,049
First ten multiples3,242,009, 6,484,018, 9,726,027, 12,968,036, 16,210,045, 19,452,054, 22,694,063, 25,936,072, 29,178,081, 32,420,090
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1195the total stopping time
Highest value reached10,941,7843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,242,009 → 9,726,028 → 4,863,014 → 2,431,507 → 7,294,522 → 3,647,261 → 10,941,784 → 5,470,892 → 2,735,446 → 1,367,723 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage324,200,900%
3,242,009% as a decimal32,420.09
3,242,009% of 1003,242,009
3,242,009% of 1,00032,420,090
As a fraction of 1003,242,009/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,242,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page