Recognised as Number
3,390,564
- Positive
- Even
- Composite
- 7 digits
3,390,564 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,390,564
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 29 × 9,743
Distinct prime factors42, 3, 29, 9,743
Number of divisors24
Sum of divisors σ(n)8,184,960
Aliquot sum4,794,396sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,091,104integers below n that share no factor with it
Carmichael function λ(n)136,388the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,091,104
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 29, 58, 87, 116, 174, 348, 9,743, 19,486, 29,229, 38,972, 58,458, 116,916, 282,547, 565,094, 847,641, 1,130,188, 1,695,282, 3,390,56424 in total
Arithmetic
Previous number3,390,563
Next number3,390,565
Double6,781,128
Half1,695,282
Square11,495,924,238,096
Cube38,977,666,868,415,726,144
Square root1,841.348418958≈irrational, shown to 9 decimal places
Cube root150.230224242≈
Negation-3,390,564
Reciprocal2.94936182 × 10^-7≈
Representations
Decimal3,390,564
Binary110011101111000110010022 bits
Octal14736144
Hexadecimal33BC64
Base 3620O6C
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and ninety thousand, five hundred and sixty-four
Ordinalthree million, three hundred and ninety thousand, five hundred and sixty-fourth
Scientific notation3.390564 × 10^6
Engineering notation3.390564 × 10^6
In other bases
Ternary20101020222110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331444224base 5; one hand: 10 digits
Septenary40551012base 7: 8 digits
Nonary6336873base 9; each digit is two ternary digits: 7 digits
Duodecimal1176170base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal113g84base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:41:49:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01011T100T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001100110110100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111011110001100100
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes333 bc 64
Gray code1010100110001001010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111011110001100100
64-bit0000000000000000000000000000000000000000001100111011110001100100
One's complement11111111110011000100001110011011at 32 bits, every bit flipped
Bits reversed00100110001111011100110000000000at 32 bits
Rotated left by 100000000011001110111100011001000at 32 bits, wrapping
Shifted left by 111001110111100011001000= 6,781,128, no wrap
Shifted right by 1110011101111000110010= 1,695,282, discarding the low bit
These bits as a double1.67516119 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,390,564 to the power 211,495,924,238,096
3,390,564 to the power 338,977,666,868,415,726,144
3,390,564 to the power 4132,156,274,088,043,098,097,705,216
3,390,564 to the power 5448,084,305,297,051,758,858,547,787,981,824
First ten multiples3,390,564, 6,781,128, 10,171,692, 13,562,256, 16,952,820, 20,343,384, 23,733,948, 27,124,512, 30,515,076, 33,905,640
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 4
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12Yes
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached5,431,0481× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,390,564 → 1,695,282 → 847,641 → 2,542,924 → 1,271,462 → 635,731 → 1,907,194 → 953,597 → 2,860,792 → 1,430,396 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage339,056,400%
3,390,564% as a decimal33,905.64
3,390,564% of 1003,390,564
3,390,564% of 1,00033,905,640
As a fraction of 1003,390,564/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,390,564
Nerdulate something else
Nothing in mind? Surprise me · today’s page