Recognised as Number
3,343,552
- Positive
- Even
- Composite
- 7 digits
3,343,552 is an even 7-digit integer and a composite number. It has 28 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,343,552
Digit count7
Digit sum25
Digit product5,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 89 × 587
Distinct prime factors32, 89, 587
Number of divisors28
Sum of divisors σ(n)6,720,840
Aliquot sum3,377,288sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,650,176integers below n that share no factor with it
Carmichael function λ(n)51,568the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,650,176
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 89, 178, 356, 587, 712, 1,174, 1,424, 2,348, 2,848, 4,696, 5,696, 9,392, 18,784, 37,568, 52,243, 104,486, 208,972, 417,944, 835,888, 1,671,776, 3,343,55228 in total
Arithmetic
Previous number3,343,551
Next number3,343,553
Double6,687,104
Half1,671,776
Square11,179,339,976,704
Cube37,378,704,537,788,612,608
Square root1,828.538213984≈irrational, shown to 9 decimal places
Cube root149.532649104≈
Negation-3,343,552
Reciprocal2.99083131 × 10^-7≈
Representations
Decimal3,343,552
Binary110011000001001100000022 bits
Octal14602300
Hexadecimal3304C0
Base 361ZNWG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-three thousand, five hundred and fifty-two
Ordinalthree million, three hundred and forty-three thousand, five hundred and fifty-second
Scientific notation3.343552 × 10^6
Engineering notation3.343552 × 10^6
In other bases
Ternary20021212111021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323443202base 5; one hand: 10 digits
Septenary40263652base 7: 8 digits
Nonary6255437base 9; each digit is two ternary digits: 7 digits
Duodecimal1152b14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10hihcbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:28:45:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T0TT1111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000010111000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110000010011000000
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes333 04 c0
Gray code1010101000011010100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110000010011000000
64-bit0000000000000000000000000000000000000000001100110000010011000000
One's complement11111111110011001111101100111111at 32 bits, every bit flipped
Bits reversed00000011001000001100110000000000at 32 bits
Rotated left by 100000000011001100000100110000000at 32 bits, wrapping
Shifted left by 111001100000100110000000= 6,687,104, no wrap
Shifted right by 1110011000001001100000= 1,671,776, discarding the low bit
These bits as a double1.65193418 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,343,552 to the power 211,179,339,976,704
3,343,552 to the power 337,378,704,537,788,612,608
3,343,552 to the power 4124,977,642,314,732,191,262,703,616
3,343,552 to the power 5417,869,245,916,707,447,560,795,200,684,032
First ten multiples3,343,552, 6,687,104, 10,030,656, 13,374,208, 16,717,760, 20,061,312, 23,404,864, 26,748,416, 30,091,968, 33,435,520
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached3,343,552
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,343,552 → 1,671,776 → 835,888 → 417,944 → 208,972 → 104,486 → 52,243 → 156,730 → 78,365 → 235,096 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,355,200%
3,343,552% as a decimal33,435.52
3,343,552% of 1003,343,552
3,343,552% of 1,00033,435,520
As a fraction of 1003,343,552/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,343,552
Nerdulate something else
Nothing in mind? Surprise me · today’s page