Recognised as Number
3,318,552
- Positive
- Even
- Composite
- 7 digits
3,318,552 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,318,552
Digit count7
Digit sum27
Digit product3,600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3^2 × 46,091
Distinct prime factors32, 3, 46,091
Number of divisors24
Sum of divisors σ(n)8,987,940
Aliquot sum5,669,388sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,106,160integers below n that share no factor with it
Carmichael function λ(n)138,270the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,106,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 46,091, 92,182, 138,273, 184,364, 276,546, 368,728, 414,819, 553,092, 829,638, 1,106,184, 1,659,276, 3,318,55224 in total
Arithmetic
Previous number3,318,551
Next number3,318,553
Double6,637,104
Half1,659,276
Square11,012,787,376,704
Cube36,546,507,574,535,812,608
Square root1,821.689325873≈irrational, shown to 9 decimal places
Cube root149.159027243≈
Negation-3,318,552
Reciprocal3.01336245 × 10^-7≈
Representations
Decimal3,318,552
Binary110010101000110001100022 bits
Octal14521430
Hexadecimal32A318
Base 361Z4M0
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighteen thousand, five hundred and fifty-two
Ordinalthree million, three hundred and eighteen thousand, five hundred and fifty-second
Scientific notation3.318552 × 10^6
Engineering notation3.318552 × 10^6
In other bases
Ternary20020121012100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322143202base 5; one hand: 10 digits
Septenary40131036base 7: 8 digits
Nonary6217170base 9; each digit is two ternary digits: 7 digits
Duodecimal1140560base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10eg7cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:21:49:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1TT11TT100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111110011101101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101010001100011000
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes332 a3 18
Gray code1010111111001010010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101010001100011000
64-bit0000000000000000000000000000000000000000001100101010001100011000
One's complement11111111110011010101110011100111at 32 bits, every bit flipped
Bits reversed00011000110001010100110000000000at 32 bits
Rotated left by 100000000011001010100011000110000at 32 bits, wrapping
Shifted left by 111001010100011000110000= 6,637,104, no wrap
Shifted right by 1110010101000110001100= 1,659,276, discarding the low bit
These bits as a double1.63958254 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,318,552 to the power 211,012,787,376,704
3,318,552 to the power 336,546,507,574,535,812,608
3,318,552 to the power 4121,281,485,804,490,970,001,903,616
3,318,552 to the power 5402,478,917,279,465,117,481,757,248,684,032
First ten multiples3,318,552, 6,637,104, 9,955,656, 13,274,208, 16,592,760, 19,911,312, 23,229,864, 26,548,416, 29,866,968, 33,185,520
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1239the total stopping time
Highest value reached3,318,552
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,318,552 → 1,659,276 → 829,638 → 414,819 → 1,244,458 → 622,229 → 1,866,688 → 933,344 → 466,672 → 233,336 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage331,855,200%
3,318,552% as a decimal33,185.52
3,318,552% of 1003,318,552
3,318,552% of 1,00033,185,520
As a fraction of 1003,318,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,318,552
Nerdulate something else
Nothing in mind? Surprise me · today’s page