Recognised as Number
3,243,649
- Positive
- Odd
- Prime
- 7 digits
3,243,649 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,243,649
Digit count7
Digit sum31
Digit product15,552
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 factorisation3,243,649
Distinct prime factors13,243,649
Number of divisors2
Sum of divisors σ(n)3,243,650
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,243,648integers below n that share no factor with it
Carmichael function λ(n)3,243,648the 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,243,6492 in total
Arithmetic
Previous number3,243,648
Next number3,243,650
Double6,487,298
Half1,621,824.5
Square10,521,258,835,201
Cube34,127,270,699,540,888,449
Square root1,801.013325881≈irrational, shown to 9 decimal places
Cube root148.028254284≈
Negation-3,243,649
Reciprocal3.08294763 × 10^-7≈
Representations
Decimal3,243,649
Binary110001011111101000000122 bits
Octal14277201
Hexadecimal317E81
Base 361XITD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and forty-three thousand, six hundred and forty-nine
Ordinalthree million, two hundred and forty-three thousand, six hundred and forty-ninth
Scientific notation3.243649 × 10^6
Engineering notation3.243649 × 10^6
In other bases
Ternary20002210110011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1312244044base 5; one hand: 10 digits
Septenary36366463base 7: 8 digits
Nonary6083404base 9; each digit is two ternary digits: 7 digits
Duodecimal1105141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal105929base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:1:0:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0010T10110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101101000001110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100010111111010000001
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
Bytes331 7e 81
Gray code1010011100000111000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100010111111010000001
64-bit0000000000000000000000000000000000000000001100010111111010000001
One's complement11111111110011101000000101111110at 32 bits, every bit flipped
Bits reversed10000001011111101000110000000000at 32 bits
Rotated left by 100000000011000101111110100000010at 32 bits, wrapping
Shifted left by 111000101111110100000010= 6,487,298, no wrap
Shifted right by 1110001011111101000000= 1,621,824, discarding the low bit
These bits as a double1.60257554 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,243,649 to the power 210,521,258,835,201
3,243,649 to the power 334,127,270,699,540,888,449
3,243,649 to the power 4110,696,887,477,295,103,276,710,401
3,243,649 to the power 5359,061,848,368,840,784,448,398,415,493,249
First ten multiples3,243,649, 6,487,298, 9,730,947, 12,974,596, 16,218,245, 19,461,894, 22,705,543, 25,949,192, 29,192,841, 32,436,490
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1239the total stopping time
Highest value reached20,782,8166× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,243,649 → 9,730,948 → 4,865,474 → 2,432,737 → 7,298,212 → 3,649,106 → 1,824,553 → 5,473,660 → 2,736,830 → 1,368,415 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage324,364,900%
3,243,649% as a decimal32,436.49
3,243,649% of 1003,243,649
3,243,649% of 1,00032,436,490
As a fraction of 1003,243,649/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,243,649
Nerdulate something else
Nothing in mind? Surprise me · today’s page