Recognised as Number
3,344,647
- Positive
- Odd
- Prime
- 7 digits
3,344,647 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,344,647
Digit count7
Digit sum31
Digit product24,192
Multiplicative persistence4times 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,344,647
Distinct prime factors13,344,647
Number of divisors2
Sum of divisors σ(n)3,344,648
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,344,646integers below n that share no factor with it
Carmichael function λ(n)3,344,646the 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,344,6472 in total
Arithmetic
Previous number3,344,646
Next number3,344,648
Double6,689,294
Half1,672,323.5
Square11,186,663,554,609
Cube37,415,440,697,932,328,023
Square root1,828.837608975≈irrational, shown to 9 decimal places
Cube root149.548971105≈
Negation-3,344,647
Reciprocal2.98985214 × 10^-7≈
Representations
Decimal3,344,647
Binary110011000010010000011122 bits
Octal14604407
Hexadecimal330907
Base 361ZOQV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-four thousand, six hundred and forty-seven
Ordinalthree million, three hundred and forty-four thousand, six hundred and forty-seventh
Scientific notation3.344647 × 10^6
Engineering notation3.344647 × 10^6
In other bases
Ternary20021220222211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324012042base 5; one hand: 10 digits
Septenary40300105base 7: 8 digits
Nonary6256884base 9; each digit is two ternary digits: 7 digits
Duodecimal1153687base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10i1c7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:29:4:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T0T1000T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110001100100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110000100100000111
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes333 09 07
Gray code1010101000110110000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110000100100000111
64-bit0000000000000000000000000000000000000000001100110000100100000111
One's complement11111111110011001111011011111000at 32 bits, every bit flipped
Bits reversed11100000100100001100110000000000at 32 bits
Rotated left by 100000000011001100001001000001110at 32 bits, wrapping
Shifted left by 111001100001001000001110= 6,689,294, no wrap
Shifted right by 1110011000010010000011= 1,672,323, discarding the low bit
These bits as a double1.65247518 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,344,647 to the power 211,186,663,554,609
3,344,647 to the power 337,415,440,697,932,328,023
3,344,647 to the power 4125,141,441,484,017,267,125,142,881
3,344,647 to the power 5418,553,946,835,193,900,438,307,761,508,007
First ten multiples3,344,647, 6,689,294, 10,033,941, 13,378,588, 16,723,235, 20,067,882, 23,412,529, 26,757,176, 30,101,823, 33,446,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached22,576,3726× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,344,647 → 10,033,942 → 5,016,971 → 15,050,914 → 7,525,457 → 22,576,372 → 11,288,186 → 5,644,093 → 16,932,280 → 8,466,140 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,464,700%
3,344,647% as a decimal33,446.47
3,344,647% of 1003,344,647
3,344,647% of 1,00033,446,470
As a fraction of 1003,344,647/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,344,647
Nerdulate something else
Nothing in mind? Surprise me · today’s page